Primes puzzle

Citrix · 2005-09-12, 05:38

Consider a prime p and a natural number n<p then K*p+n is composite atleast twice with k in the range 0<=k<=(p-1)

I think the above holds for all primes, I have a simple proof for this. Lets see if you can find it.

Citrix

Citrix · 2005-09-12, 06:33

Quote:

Originally Posted by Citrix

Consider a prime p and a natural number n<p then K*p+n is composite atleast twice with k in the range 0<=k<=(p-1)

I think the above holds for all primes, I have a simple proof for this. Lets see if you can find it.

Citrix

Never mind, there is an error in the above.
Sorry
Citrix

2005-09-12, 05:38	#1
Citrix Jun 2003 1579₁₀ Posts	Primes puzzle Consider a prime p and a natural number n<p then K*p+n is composite atleast twice with k in the range 0<=k<=(p-1) I think the above holds for all primes, I have a simple proof for this. Lets see if you can find it. Citrix

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Mersenne Primes p which are in a set of twin primes is finite?	carpetpool	Miscellaneous Math	3	2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found	emily	Math	34	2017-07-16 18:44
Some puzzle	Harrywill	Puzzles	4	2017-05-03 05:10
4 4s puzzle	henryzz	Puzzles	4	2007-09-23 07:31
possible primes (real primes & poss.prime products)	troels munkner	Miscellaneous Math	4	2006-06-02 08:35