Prev: PROOF INFINITY DOES NOT EXIST! Not even ONE type
Next: Sum Involving GCD And Cosine
From: raycb on 7 Jul 2010 13:35
On Jul 7, 2:30 pm, raycb <ra...(a)live.com> wrote:
> Let p be an odd prime larger than 3. Generate pairs of even numbers 2p
> + 2 and 2p - 2, 2p + 4 and 2p - 4, 2p + 6 and 2p - 6, and so on, until
> 2n is reached, where n is the prime that precedes p.
>
>   Conjecture: each member of a pair can be written as the sum of two
> odd primes in a way that both sums share a common prime. It holds for
> all p < 100.
>
> For example:
>
> 166 = 2*83
>
> 164 = 157 + 7
>
> 168 = 157 + 11
>
> 162 = 157 + 7
>
> 170 = 157 + 13
>
> 160 = 131 + 29
>
> 172 = 131 + 41
>
> 158 = 151 + 7
>
> 174 = 151 + 23

Should read:

162 = 157 + 5
 | 
Pages: 1
Prev: PROOF INFINITY DOES NOT EXIST! Not even ONE type
Next: Sum Involving GCD And Cosine