Question: Write a pseudocode to describe an algorithm that takes a list of n distinct integers a_1, a_2, ...a_n, as input, and outputs the location of
Write a pseudocode to describe an algorithm that takes a list of n distinct integers a_1, a_2, ...a_n, as input, and outputs the location of the largest prime number (0 if no prime number is found). Add all the digits of your EMPLID, and denote the result as a. Find a smallest integer b greater than 10 and ensure that a and b are relatively prime. Solve the linear congruence equation bx identicalto 3 mod a
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
