mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2005-09-12, 05:38   #1
Citrix
 
Citrix's Avatar
 
Jun 2003

110001001112 Posts
Default 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
Citrix is offline   Reply With Quote
Old 2005-09-12, 06:33   #2
Citrix
 
Citrix's Avatar
 
Jun 2003

32×52×7 Posts
Default

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
Citrix is offline   Reply With Quote
Reply

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 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

All times are UTC. The time now is 08:38.

Sat Nov 28 08:38:10 UTC 2020 up 79 days, 5:49, 3 users, load averages: 1.37, 1.63, 1.63

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.