Solution to Prove that there are infinitely many primes of the form 6k + 5. That is, … - Sikademy

Nov. 27, 2020

Archangel Macsika Sikademy Image

Archangel Macsika

Prove that there are infinitely many primes of the form 6k + 5. That is, consider the primes which has a remainder 5 when divided by 6. Prove that there are infinitely many such primes.

Solution

Note that if we multiply 2 numbers of the form 6k + 1 together, we get another number of the same form

If there were only finitely many primes of the form 6k + 5, say

p0 = 5 < p1 < p2 < · · · < pn.

Consider the integer

N = 6p1p2 · · · pn + 5.

Clearly N > 1 is not divisible by 2 and the note with which we began this solution implies that N has at least one prime divisor p of the form 6k + 5. If p = 5, we get that

5|N − 5 = 6p1p2 · · · pn,

while, if p > 5, we have that

5|N − 6p1p2 · · · pn = 5.

In either case, we have a contradiction.

If you would like to see a different solution or an implementation in a different programming language Kindly let us know



Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers