#9 step by step

) 289 f) 899 5. Find the prime factorization of 10 7. Express in pseudocode the trial division algorithm for 8. Express in pseudocode the algorithm described in the text 9. Show that ifa 1 is composite if a and m are integers *6. How many zeros are there at the end of 100!? determining whether an integer is prime. for finding the prime factorization of an integer. greater than 1 and m is odd. |Hint: Show that x +1 is a factor of the polynomial x +1 if m is odd.] 10. Show that if 2m+l is an odd prime, then m=2" for some nonnegative integer n. [Hint: First show that the polynomial identity xm+-(Xk+1)(Xk(1-1) Xk(1-2) + ...-xk+1) holds, where m=kt and t is odd.] Show that lopa 3 is an irrational numos Pasu 11. ) 289 f) 899 5. Find the prime factorization of 10 7. Express in pseudocode the trial division algorithm for 8. Express in pseudocode the algorithm described in the text 9. Show that ifa 1 is composite if a and m are integers *6. How many zeros are there at the end of 100!? determining whether an integer is prime. for finding the prime factorization of an integer. greater than 1 and m is odd. |Hint: Show that x +1 is a factor of the polynomial x +1 if m is odd.] 10. Show that if 2m+l is an odd prime, then m=2" for some nonnegative integer n. [Hint: First show that the polynomial identity xm+-(Xk+1)(Xk(1-1) Xk(1-2) + ...-xk+1) holds, where m=kt and t is odd.] Show that lopa 3 is an irrational numos Pasu 11