Proving Sum of Two Primes is Never Twice a Prime

  • Thread starter sachinism
  • Start date
  • Tags
    Primes Sum
In summary, the conversation discusses the proof that the sum of two consecutive primes can never be twice a prime. The conversation also mentions a previous thread that discusses a similar topic. A mathematical explanation is provided to support the argument.
  • #1
sachinism
66
0
Prove that sum of two primes can never be twice a prime

p.s: find the actual edited q in 4th post belowsorry for the mistake
 
Last edited:
Physics news on Phys.org
  • #2
'twice a prime' ?
 
  • #3
sachinism said:
Prove that sum of two primes can never be twice a prime

Counter examples: 2 (a prime) + 2 (a prime) = 4 = twice 2 (a prime); or if you object to using the same prime twice or more: 7 + 19 = 26 = 2 x 13
 
Last edited:
  • #4
ah my bad

this is the correct q

Show that sum of two consecutive primes is never twice a prime
 
  • #5
What is the difference between consecutive primes?
 
  • #6
It seems to me that this question is redundant of an earlier thread on November 12which depended upon the fact that the average of two consecutive odd primes can not be a prime.
 
Last edited:
  • #7
@ramsey

can you give me the link of that thread please
 
  • #8
Let [tex](j, k)\in\mathb{N}^2[/tex]. Without loss of generality, assume [tex]j < k[/tex].


From here, it's safe to assume that: [tex]\forall (j, k)[/tex], [tex]j < \frac{j + k}{2} < k[/tex].


Then, [tex]p_n < \frac{p_n + p_{n+1}}{2} < p_{n+1}[/tex].


Since [tex]p_n[/tex] and [tex]p_{n+1}[/tex] are consecutive primes, [tex]\frac{p_n + p_{n+1}}{2}[/tex] cannot be prime.
 

FAQ: Proving Sum of Two Primes is Never Twice a Prime

What is the "Proving Sum of Two Primes is Never Twice a Prime" problem?

The "Proving Sum of Two Primes is Never Twice a Prime" problem is a mathematical conjecture that states that the sum of any two prime numbers can never be equal to twice another prime number.

Why is this problem important?

This problem is important because it has significant implications in number theory and cryptography, as well as providing insights into the distribution of prime numbers.

Has this problem been solved?

No, this problem has not been solved and it remains an unsolved mathematical conjecture.

What are some approaches to solving this problem?

Some approaches to solving this problem include using mathematical induction, exploring the properties of prime numbers, and using techniques from algebraic number theory.

What are the potential applications of a solution to this problem?

A solution to this problem could have potential applications in cryptography, as it could help in finding more secure methods for generating prime numbers. It could also lead to further insights and advancements in the field of number theory.

Similar threads

Back
Top