October 15th, 2015, 05:07 AM  #1 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41  Conjecture about primes of the form 2^k1
Here is a little conjecture not easy to prove. Let us define an odd prime number p=2^k1 Example : p=31 = 1+2+4+8+16 Now let us compute 5 values (31 is a sum of 5 values) v1=311=30 v2=312=29 v3=314=27 v4=318=23 v5=3116=15 Each time we remove from the sum 31 one the elements 2^0,2^1,2^2,2^3,2^4 2 values are prime numbers : 29 and 23 Conjecture: For any odd prime p=(2^k)1 (k>2) it always exist at least one prime number v(i) such as v(i)=(2^k2^i)1 with i varying from 0 to k. 
October 15th, 2015, 07:17 AM  #2 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41 
No one is forced to read nor to answer. If you are interested by the question then welcome to your comments as long as they are related to the problem. Otherwise stay mum. To AlMahed and Charles I`m not beggar nor student trying to solve his homework. I posted this conjecture in many forums. I do not care if it is going to be read or not. I`m here to exchange points of view. Thank you. 
October 15th, 2015, 07:39 AM  #3 
Member Joined: Jun 2015 From: Ohio Posts: 99 Thanks: 19 
2^31  1 is a prime that this conjecture does not hold with. I checked 2^31  1  2^k from k = 0 to 31 and none of the values were prime.

October 15th, 2015, 08:00 AM  #4 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41  
October 15th, 2015, 11:15 AM  #5 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41 
All the number v(i) have 1 zero when written in base 2. Can we state that any odd large number written in base 2 using only one zero is probably composite? 111111111011111111 composite or prime? What is the probability that such number picked randomly is prime? Why numbers of the form 11111111111111111111111111111 in BASE 2 are rarely prime? 
October 15th, 2015, 12:39 PM  #6 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41 
Once a conjecture is false it seems like everything is solved. Why is it false? What if the inverse was true? What will happen large Mersenne primes? will it have at least one prime or not? Can we prove that the conjecture definitely false for n>31? 
October 16th, 2015, 04:42 AM  #7  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 937 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Quote:
Actually it fails for every Mersenne prime I've tested greater than M5 = 2^5  1: exponents 7 to 756839. I didn't expect so many failures to be honest (see my heuristic above).  
October 16th, 2015, 05:10 AM  #8 
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41 
Proving that the conjecture is false for large Mersenne numbers will be useful. In fact I`m trying to find a range of values where it is highly unlikely that it will contain a prime but it can be proved that this range contain necessarly at least one prime. You did not remember on old post : There is always one prime between n! and n!+n^2 (I do not remember exactly but you could find it in this forum). 
October 16th, 2015, 05:18 AM  #9  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 937 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Quote:
 
October 16th, 2015, 05:40 AM  #10  
Banned Camp Joined: Dec 2013 Posts: 1,117 Thanks: 41  Quote:
If you start by this obvious observation then it surely exist a thick range containing at least one prime. Primes have nothing to do with randomness even they look like random.  

Tags 
2k1, conjecture, form, primes 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Conjecture about the number of primes  uvkajed  Number Theory  2  August 5th, 2015 10:51 AM 
Conjecture about primes of a special form  Sebastian Garth  Number Theory  9  November 22nd, 2013 02:38 PM 
Conjecture on cycle length and primes : prime abc conjecture  miket  Number Theory  5  May 15th, 2013 05:35 PM 
Twin primes conjecture  ibougueye  Number Theory  1  August 13th, 2012 08:24 PM 
New conjecture about primes ?  Bogauss  Number Theory  32  March 1st, 2012 06:30 AM 