20050912, 05:38  #1 
Jun 2003
11000100111_{2} 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<=(p1)
I think the above holds for all primes, I have a simple proof for this. Lets see if you can find it. Citrix 
20050912, 06:33  #2  
Jun 2003
3^{2}×5^{2}×7 Posts 
Quote:
Sorry Citrix 

Thread Tools  
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  20170810 13:47 
Distribution of Mersenne primes before and after couples of primes found  emily  Math  34  20170716 18:44 
Some puzzle  Harrywill  Puzzles  4  20170503 05:10 
4 4s puzzle  henryzz  Puzzles  4  20070923 07:31 
possible primes (real primes & poss.prime products)  troels munkner  Miscellaneous Math  4  20060602 08:35 