SOLUTION: Prove that for any prime k>2, some prime k-2 or k+2 exists.

SOLUTION: Prove that for any prime k>2, some prime k-2 or k+2 exists.

Algebra.Com

Question 1005057: Prove that for any prime k>2, some prime k-2 or k+2 exists.
Answer by ikleyn(52802) (Show Source): You can put this solution on YOUR website!
.
Your statement is wrong.

Indeed, consider the prime k = 23.

k-2 = 21 is not prime.

k+2 = 25 is not prime.

RELATED QUESTIONS
suppose that V is finite-dimensional space and T:V->V is a linear operator. 1. prove... (answered by ikleyn)

Let n be a positive integer, k the number of prime numbers less than or equal to n, and... (answered by richard1234)

Prove that, log(n) >= k.log(2) (Where n >= 2 and "k" denote the number of distinct prime... (answered by richard1234)

"if (2^k)-1 is a prime number then, prove that (2^(k-1))(2^k-1)is a perfect number." (i... (answered by MathLover1)

if 2^k-1 is a prime number,then show that 2^(k-1).(2^k-1)is a perfect... (answered by richard1234)

For arbitrary positive integers k, m, and n, will there exist a prime p such that... (answered by Edwin McCravy)

I am trying to prove the following identity by induction (basic number theory course):... (answered by longjonsilver)

Prove that {{{(1+cosx+isinx)^k + (1+cosx-isinx)^k}}}... (answered by ikleyn)

Factor completely or state that the polynomial is prime. 25x^2 + 30x - 36 Find the... (answered by Alan3354,MathTherapy,greenestamps)