## All Composites

Expand Messages
• Hello all: Prove that n+(Prime[n])^n is composite for all n =4 or find a countraexample. (for n odd is trivial) (for n=q-1 q prime is also trivial; Fermat
Message 1 of 2 , Nov 9, 2008
• 0 Attachment
Hello all:

Prove that n+(Prime[n])^n is composite for all n>=4 or find a countraexample.

(for n odd is trivial)
(for n=q-1 q prime is also trivial; Fermat little Theorem)
but the other cases?

Sincerely

Sebastián Martín Ruiz

[Non-text portions of this message have been removed]
• ... Such quickly growing sequences not containing primes after a certain stage is mathematically usually not particularly interesting, as the probability of it
Message 2 of 2 , Nov 9, 2008
• 0 Attachment
--- On Sun, 11/9/08, Sebastian Martin <sebi_sebi@...> wrote:
> Hello all:
>
> Prove that n+(Prime[n])^n is composite for all n>=4 or
> find a countraexample.

Such quickly growing sequences not containing primes after a certain stage is mathematically usually not particularly interesting, as the probability of it being false is so low. If the particular form itself is not mathematically interesting, the level of disinterest is squared.

Phil
Your message has been successfully submitted and would be delivered to recipients shortly.