It states p(n) = n II (1 - ). pn where the product is over the...

Transcribed Image Text:

It states p(n) = n II (1 - ¹). pn where the product is over the distinct prime numbers & dividing n. An equivalent formulation for n = = P₁ P2 *** p. where p₁, P2,...,pr are the distinct primes dividing n, is: (n) = P₁¹¹(p₁-1) p (p2-1) p (p-1). ... HW: 1) Calculate phi 120. 2) Apply the extended Euclidean algorithm, and find A so that 49A-1 mod 120. 3) Calculate C-f_49 (5) if f_49:Z_120--->Z_120 is defined as f(x)=49x mod 120 4) Calculate f_A(C), where A is the answer to question 2), and C is answer to question 3), and f_A(x) =Ax mod 120. 5) Did you get 5? It states p(n) = n II (1 - ¹). pn where the product is over the distinct prime numbers & dividing n. An equivalent formulation for n = = P₁ P2 *** p. where p₁, P2,...,pr are the distinct primes dividing n, is: (n) = P₁¹¹(p₁-1) p (p2-1) p (p-1). ... HW: 1) Calculate phi 120. 2) Apply the extended Euclidean algorithm, and find A so that 49A-1 mod 120. 3) Calculate C-f_49 (5) if f_49:Z_120--->Z_120 is defined as f(x)=49x mod 120 4) Calculate f_A(C), where A is the answer to question 2), and C is answer to question 3), and f_A(x) =Ax mod 120. 5) Did you get 5?

Answer rating: 100% (QA)

1 phi120 40 2 A 25 3 C 5 4 fAC125 5 No The number of int... View the full answer