We will first show that when l=p(p-1), then the property holds. Let , that is for some integer k.
If , the trivially as .
Look at
.
hence . Now since since .
Therefore .
We now show that p(p-1) is the smallest integer with this property. Let l be any integer with the property.
Take . Look at the following equation modulo p
Which means . Hence .
Take , then
as .
. But p is an odd prime hence
. But 2 have order p-1 in the multiplicative group .
Hence .
We have that . The smallest such integer is p(p-1).
Therefore the period is p(p-1).
Let p be a prime. Consider the sequence 11,22,3, 44,55 modulo p. Prove that the resulting...
Let p be an odd prime. Prove that if g is a primitive root modulo p, then g^(p-1)/2 ≡ -1 (mod p). Let p be an odd prime. Prove that if g is a primitive root modulo p, then go-1)/2 =-1 (mod p) Hint: Use Lemma 2 from Chapter 28 (If p is prime and d(p 1), then cd-1 Ξ 0 (mod p) has exactly d solutions). Let p be an odd prime. Prove that if g is a primitive...
7.23 Theorem. Let p be a prime congruent to 3 modulo 4. Let a be a natural number with 1 a< p-1. Then a is a quadrutic residue modulo pif and only ifp-a is a quadratic non-residue modulo p. 7.24 Theorem. Let p be a prime of the form p odd prime. Then p 3 (mod 4). 241 where q is an The next theorem describes the symmetry between primitive roots and quadratic residues for primes arising from odd Sophie...
Let p be a prime with p ≥ 13. Prove that among the integers 2,11 and 22, either all three are quadratic residues modulo p or exactly one is a quadratic residue modulo p.
2.5. Let p be an odd prime and let g be a primitive root modulo has a square root modulo p if and only if its discrete logarithm log,(a) mod p. Prove t that is even.
Please prove the 3 theorems, thank you! 7.6 Theorem. Let p be a prime. Then half the numbers not congruent to 0 modulo p in any complete nesidue system modulo p are quadratic residuess modulo p and half are quadratic non-residues modulo p. From clementary school days, we have known that the product of a pos- itive number and a positive number is positive, a positive times a negative is negative, and the product of two negative numbers is positive....
76.Let p be an odd prime. Prove that if Ord, (a) = his even, then a/2 = -1 mod p. 77.let p be an odd prime. Prove that if Ord, (a) = 3, then 1+ a + a? = 0 mod p and Ord,(1 + a) = 6. 78.Show that 3 is a primitive root modulo 17. How many primitive roots does 17 have? Find them.
please prove proofs and do 7.4 7.2 Theorem. Let p be a prime, and let b and e be integers. Then there exists a linear change of variahle, yx+ with a an integer truns- farming the congruence xbx e0 (mod p) into a congruence of the farm y (mod p) for some integer 8 Our goal is to understand which integers are perfect squares of other inte- gers modulo a prime p. The first theorem below tells us that half...
We know that we can reduce the base of an exponent modulo m: a(a mod m)k (mod m). But the same is not true of the exponent itself! That is, we cannot write aa mod m (mod m). This is easily seen to be false in general. Consider, for instance, that 210 mod 3 1 but 210 mod 3 mod 3 21 mod 3-2. The correct law for the exponent is more subtle. We will prove it in steps (a)...
Let g be a primitive root modulo to the odd prime p. Prove that: 2)=-1 2)=-1
(b) Let p be a prime that is congruent to 3 modulo 4. Let b ∈ Z. Let a = b (p+1)/4 . Show that a 2 ≡ ±b (mod p). (c) Give an algorithm to compute square roots of something modulo p, when p ≡ 3 (mod 4). Note: Not all things are square modulo p, so the algorithm should return the square root or inform you there is no square.