SOLUTION: Prove that there are countably many primes of the form 8n − 1 or 8n + 3.

SOLUTION: Prove that there are countably many primes of the form 8n − 1 or 8n + 3.

Algebra.Com

Question 1033749: Prove that there are countably many primes of the form 8n − 1 or 8n + 3.
Answer by ikleyn(52777) (Show Source): You can put this solution on YOUR website!

RELATED QUESTIONS
Prove that there are infinitely many primes of the form 6n − 1. (answered by ikleyn)

How many positive integers n are there such that 2n+1 is a divisor of... (answered by ikleyn,greenestamps)

Prove by mathematical induction that 3^(2n)-8n-1, n is a positive integer, is a multiple... (answered by Edwin McCravy)

Which expression represents the sum of the following? (3n / n^2 - 2n + 1) + (5 / n... (answered by checkley77)

4(2n+4=6(8n+1)+9 8n+16=6(8n+1)+9 8n+16=48n+6+9 8n+16=48n+15 8n16-48n=48n+15+48... (answered by josgarithmetic)

Prove that for any positive integer n, the value of the expression 3^(2n+2)-8n-9 is... (answered by richard1234)

What is the discriminant of -8n^2+8n+6=8? and how many solutions does it have and what... (answered by MathLover1)

Simplify the expression. 8n - (n -... (answered by Aaniya)

3n+46=1+8n (answered by bonster)