(ii) Let a be a number of the form a = 6n + 1 or a = 6n−1 for some integer n. Show that a2 ≡ 1 (mod 24). (Hint: Calculate (6n±1)2 and consider two different cases for n.)
If then . If then . Now, there are two cases:
Case I: is even, say ; then either
or
Thus, either way we have .
Case II: is odd, say ; then either
or
Thus, either way we have .
This proves that .
Problem 6: Let p be an odd prime number, so that p= 2k +1 for some positive integer k. Prove that (k!)2 = (-1)k+1 mod p. Hint: Try to see how to group the terms in the product (p − 1)! = (2k)! = 1 * 2 * 3... (2k – 2) * (2k – 1) * (2k) to get two products, each equal to k! modulo p.
Let p be an odd prime. Write p in the form p = 2k + 1 for some k E N. Prove that kl-(-1)* mod p. Hint: Each j e Z satisfies j (p-od p.
3. (RSA) Consider N-pq where p- 3 and q 5. (a) Calculate the value of N p. N 15 (b) Let c 3 be the encoding number. Verify that c satisfies the require- ments of an encoding number (c) Find the decoding number d. [Hint: cd Imod(p 1)(q 1).] 3dI mod 2 (d) Consider the single character message 'b' (not including the quotes) Using its ASCII code it becomes the numerical plaintext message " 98 Calculate the encrypted message ba...
(1) Consider Z with the addition and multiplication mod 3 as usual. Let R=ZgxZg. Define (a, b)+ (a',b) (aab+and(a,b)((aa-bab +a'b) (a) Show that (R, +) is a commutative ring. b) Show that (1,0) is the identity element for the multiplication. c) Show that the equation 22 hs exactly two solutions in R Bonus Problem) Show that (R, +,.) is a field. (Hint: To find multiplicative inverse, first show that a2 + b2メ0 if (a, b)メ(0.0). Then compute (a, b).(a,-b).) (1)...
ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2 (mod n) for some x Prove that ged(x - yn) and ged(x + y, n) are nontrivial divisors of n.
Number theory: Part C and Part D please! QUADRA range's Four-Square Theorem) If n is a natural be expressed as the sum of four squares. insmber, then n cam be expressed tice Λ in 4-space is a set of the form t(x,y, z, w). M:x,y,z, w Z) matrix of nonzero determinant. The covolume re M is a 4-by-4 no is defined to be the absolute value of Det M such a lattice, of covolume V, and let S be the...
Prove: Let k be a positive integer, and set n :=2k-1(2k – 1). Then (2k+1 – 1)2 = 8n +1 Prove: Let n be a positive integer, and let s and t be integers. Show that Hire (st) = n(s) in (t) mod n.
I need help with number 3 on my number theory hw. Exercise 1. Figure out how many solutions x2 = x (mod n) has for n = 5,6,7, and then compute how many solutions there are modulo 210. Exercise 2. (a) Find all solutions to x2 +8 = 0 (mod 11). (b) Using your answer to part (a) and Hensel's Lemma, find all solutions to x2 +8 = 0 (mod 121). Exercise 3. Solve f(x) = x3 – x2 +...
Let n be a nonnegative integer and let F 22 + 1 be a Fermat number. Prove that if is a prime number, then either n=0 or 3--1mod F. [Hint: If n 2 1, use the law of quadratic reciprocity to evaluate the Legendre symbol (3/F). Now use Euler's Criterion (Theorem 4.4).] Let n be a nonnegative integer and let F 22 + 1 be a Fermat number. Prove that if is a prime number, then either n=0 or 3--1mod...
4. Let n be a natural number (a) Prove that -2 ()= ("71). (Hint: consider the cases n 1 and n 2 2 separately.) 3 () (b) Conjecture and prove a similar expression for 3 ()? .n (c) What is