4. Suppose that p is a prime of the form 8k + 1 . Show that the congruence x4 has ether 0 solutio...

Question

Question

Answer 1

Answer #1

Goenbet ชื่ะเ@ch Đ jen) a be a amc pletyelyト4.me top les ide er a며 a be m.nt9e gelehce eme乍-p uon p-214 , , x has Sol2dfons,

Answer 2

Similar Homework Help Questions

2. Let p be an odd prime. We saw last week that the problem of counting solutions to the congruen...

2. Let p be an odd prime. We saw last week that the problem of counting solutions to the congruence (mod p) is only interesting when p has the form 4k1. For the rest of this problem let p 4k+1. (a) Show that (mod -1 5 (mod 8) (b) Show that pEl (mod 8 -1 p5 (mod 8) (c) Draw condlusions about the number of solutions to these congruences 14 (mod p) -1 (mod p) (mod p) 2. Let p...
39. Suppose that the polynomial congruence f(x)0 (mod 7) has two distinct so- 0 lutions, what are the possible number of solutions of the congruence f(x) (mod 49)? 39. Suppose that the polyn...

39. Suppose that the polynomial congruence f(x)0 (mod 7) has two distinct so- 0 lutions, what are the possible number of solutions of the congruence f(x) (mod 49)? 39. Suppose that the polynomial congruence f(x)0 (mod 7) has two distinct so- 0 lutions, what are the possible number of solutions of the congruence f(x) (mod 49)?
22. Suppose that (ab, p)- 1 and that p> 2. Show that the number of solutions (x, y) of the congru...

22. Suppose that (ab, p)- 1 and that p> 2. Show that the number of solutions (x, y) of the congruence ax2 + by 1 (mod p) is -ab 22. Suppose that (ab, p)- 1 and that p> 2. Show that the number of solutions (x, y) of the congruence ax2 + by 1 (mod p) is -ab

8. Let g be a primitive root of an odd prime p, and suppose that p3 (mod 4). Show that -g is not ...

8. Let g be a primitive root of an odd prime p, and suppose that p3 (mod 4). Show that -g is not a primitive root of p. 8. Let g be a primitive root of an odd prime p, and suppose that p3 (mod 4). Show that -g is not a primitive root of p.
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 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...
g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p) g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p)

g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p) g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p)

5. Let p be a prime with p Ξ 1 (mod 4). Suppose that ai, a2, . . . ,a(p-1)/2 are the quadratic re...

5. Let p be a prime with p Ξ 1 (mod 4). Suppose that ai, a2, . . . ,a(p-1)/2 are the quadratic residues of p that lie between 1 and p - 1. Prove that 1,0 (P-1)/2 i- 1 Hint: If a is a quadratic residue less than or equal to (p-1)/2 then what is p - ai? 5. Let p be a prime with p Ξ 1 (mod 4). Suppose that ai, a2, . . . ,a(p-1)/2 are...
1. (Complex Multiplication) Let E : y x3 y23 to this congruence mod p. So for...

1. (Complex Multiplication) Let E : y x3 y23 to this congruence mod p. So for example, #E(Z3) = 3 because we have the solutions (0, 0), (1,0) and (2,0) and no more. - x. Then we can reduce E mod p to get mod p for various primes p. We write #E(Z») for the number of solutions This particular equation has some miraculous explore here patterns we (a) Make a chart that lists p, #E(Zp), and #E(Z) - p...
Prove that that if p is a prime such P = 1 (mod 4), then (972)...

Prove that that if p is a prime such P = 1 (mod 4), then (972) != -1 (mod P).

Let p be an odd prime. Write p in the form p = 2k + 1...

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.