Proof using the Euler Function
Use the formula for ø(n) to find all positive integers n such that ø(n)=6 .
(See attached file for full problem description) Conjecture: Suppose that m and n are positive integers. If gcd(m,n)=1, then . a. If m and n are positive integers and k is any integer, show that gcd(k,mn)=1 if and only if gcd(k,m)=1 and gcd(k,n)=1. b. Suppose gcd(m,n)=1. Prove that establishes a bijection between ...continues
(See attached file for full problem description) --- We consider the special case when m=3 and n=4. (a) Write down the correspondence between numbers in and pairs of integers in given by the function f. In other words, write out the 12 values f(a) where . (b) Fore each value you computed above, circle the equations ...continues
(See attached file for full problem description) --- We consider the special case when m=3 and n=5. (a) Find the explicit function from the Chinese Remainder Theorem Chapter summary. (Recall that g is the inverse function of f.) (b) Write down all ordered pairs (a,b) Є . (c) Compute g(a,b) for each ordered pair in ...continues
(See attached file for full problem description with all symbols) Suppose d and n are integers greater than 1 such that . If a is an integer relatively prime to n, show that .
(See attached file for full problem description with all symbols) --- Suppose that n is odd and a is a primitive root modulo n. (a) Show that there exists and integer b such that and . (b) Show that b is a primitive root modulo 2n.
(See attached file for full problem description) --- Assume r and s are relatively prime positive integers and that n=rs. Let and assume that gcd(a,n)=1. Prove: (a) (b)
(See attached file for full problem description)
(See attached file for full problem description)
What are the quadratic residues modulo 19?
