## Composites and Primes

Expand Messages
• It is not very hard to prove by induction that n_th composite number C(n) is: C(n)=n+k where k is such that nextprime(C(n))=k-th prime. If we choose now
Message 1 of 1 , Dec 12, 2004
• 0 Attachment
It is not very hard to prove by induction that n_th composite number C(n) is:
C(n)=n+k where k is such that nextprime(C(n))=k-th prime.
If we choose now n=p=prime and k =C(p)-p=prime ,we obtain the following sequence of composites with a prime index and nextprime(C(p))=(C(p)-p)-th prime with C(p)-p prime.------->8,10,14,30,54,58,62,66,82,108,114,120,178,182,204,210,318,324,330,352,
366,430,506,544,560,586,596,616,704,738,792,858,870,914,918,960,988,
990,1026,1030,1062,1164

So C(37)=54=37+17 and P(17)=59=nextprime(C(37))

We get here a relaton composite-prime that do not depend on a divisibility criteria.Thouh knowing n_th composite still depends of the knoledge of primes.

And we get even composites that are sum of 2 primes.(not all even composites,of course)
I cannot prove this sequence is infinite,though Mike or Jens might manage it.
If a proof of infiniteness of this sequence is considered to be too hard,then what can we say of a proof of Goldbach conjecture???

Robin Garcia

---------------------------------

[Non-text portions of this message have been removed]
Your message has been successfully submitted and would be delivered to recipients shortly.