Question: Please dont answer after 09/26 3. Use the Euclidean algorithm to compute: ged(30030, 257). Don't just list the answer. Show the steps of the Euclidean
3. Use the Euclidean algorithm to compute: ged(30030, 257). Don't just list the answer. Show the steps of the Euclidean algorithm. a. b. Using the result of part (a) and the fact that 30030 2*3 * 5*7 11 13, show that 257 is a prime number. That is, explain why 257 must be a prime number using this factorization of 30030 and the ged you computed in part a. 4. Suppose x 2 (mod 7) and x3 (mod 10). What is x congruent to mod 70
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
