5
answers
0
watching
48
views

Let p be a prime with p ≡ 3 (mod 4), and suppose that q = 2p + 1 is also prime.

(a) Show that 2 is a square mod q.

(b) Show that 2p ≡ 1 (mod q), so q | j 2p - 1. (This explains the fact that 23 | 211 - 1.)

It is not yet proved that there are infinitely many primes p such that 2p + 1 is prime. It is also not yet proved that there are infinitely many primes p for which Mp is composite.

For unlimited access to Homework Help, a Homework+ subscription is required.

Unlock all answers

Get 1 free homework help answer.
Get unlimited access
Already have an account? Log in
Get unlimited access
Already have an account? Log in
Get unlimited access
Already have an account? Log in
Get unlimited access
Already have an account? Log in
Get unlimited access
Already have an account? Log in

Related textbook solutions

Related questions

Weekly leaderboard

Start filling in the gaps now
Log in