My Math Forum  

Go Back   My Math Forum > College Math Forum > Number Theory

Number Theory Number Theory Math Forum


Thanks Tree2Thanks
Reply
 
LinkBack Thread Tools Display Modes
October 16th, 2015, 06:45 AM   #11
Banned Camp
 
Joined: Dec 2013

Posts: 1,117
Thanks: 41

Building a NON TRIVIAL and INFINITE sequence of composites numbers where no element is divided by any p < B
(B is bound equal for example to 10.000 (I mean the first prime < 10.000)) is interesting.
It will be a big discovery.

Last edited by mobel; October 16th, 2015 at 07:12 AM.
mobel is offline  
 
October 16th, 2015, 07:12 AM   #12
Member
 
Joined: Jun 2015
From: Ohio

Posts: 99
Thanks: 19

Here's a conjecture I thought of that definitely seems interesting. It's held for the few random values I've checked... Of course I have yet to check any large values (I'll do that later).

If $\displaystyle 2^k - 2^j - 1$ is composite for all j from j = 1 to k - 1 then $\displaystyle 2^k - 1$ is a Mersenne Prime. It's not an if and only if because not all Mersenne primes have this property, but what if having this property guarantees it is a Mersenne prime?
numberguru1 is offline  
October 16th, 2015, 07:14 AM   #13
Banned Camp
 
Joined: Dec 2013

Posts: 1,117
Thanks: 41

Quote:
Originally Posted by numberguru1 View Post
Here's a conjecture I thought of that definitely seems interesting. It's held for the few random values I've checked... Of course I have yet to check any large values (I'll do that later).

If $\displaystyle 2^k - 2^j - 1$ is composite for all j from j = 1 to k - 1 then $\displaystyle 2^k - 1$ is a Mersenne Prime. It's not an if and only if because not all Mersenne primes have this property, but what if having this property guarantees it is a Mersenne prime?
k>5
mobel is offline  
October 16th, 2015, 07:17 AM   #14
Member
 
Joined: Jun 2015
From: Ohio

Posts: 99
Thanks: 19

? k>5 isn't a counterexample... k = 6 works
numberguru1 is offline  
October 16th, 2015, 07:30 AM   #15
Banned Camp
 
Joined: Dec 2013

Posts: 1,117
Thanks: 41

Quote:
Originally Posted by numberguru1 View Post
? k>5 isn't a counterexample... k = 6 works
Sorry. I did a mistake.
When k=3

2^3-1=7

7-2=5
7-4=3
Both are prime not composite

2^3-1 is a Mersenne prime so you have to bound k

2^5-1 is also a Mersenne prime

Anyway you have to bound k

Last edited by mobel; October 16th, 2015 at 07:33 AM.
mobel is offline  
October 16th, 2015, 07:45 AM   #16
Global Moderator
 
CRGreathouse's Avatar
 
Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Quote:
Originally Posted by mobel View Post
Primes are not random.
If you start by this obvious observation then it surely exist a thick range containing at least one prime.
Yes, that observation is obvious. But you misunderstood my point -- it's thinness, not thickness, that made the Heath-Brown proof interesting. (Sorry, I reread my post and it was confusing. Heath-Brown's sequence is somewhat thin -- less than x^(2/3) numbers up to x. You're asking about much thinner sequences, and so that would be far harder in general.)

Last edited by CRGreathouse; October 16th, 2015 at 07:53 AM.
CRGreathouse is offline  
October 16th, 2015, 07:46 AM   #17
Global Moderator
 
CRGreathouse's Avatar
 
Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Quote:
Originally Posted by mobel View Post
Building a NON TRIVIAL and INFINITE sequence of composites numbers where no element is divided by any p < B
(B is bound equal for example to 10.000 (I mean the first prime < 10.000)) is interesting.
It will be a big discovery.
I'd be happy to try -- I have some ideas in mind -- but I'll need a definition of "NON TRIVIAL" first.
CRGreathouse is offline  
October 16th, 2015, 07:51 AM   #18
Global Moderator
 
CRGreathouse's Avatar
 
Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Quote:
Originally Posted by numberguru1 View Post
Here's a conjecture I thought of that definitely seems interesting. It's held for the few random values I've checked... Of course I have yet to check any large values (I'll do that later).

If $\displaystyle 2^k - 2^j - 1$ is composite for all j from j = 1 to k - 1 then $\displaystyle 2^k - 1$ is a Mersenne Prime. It's not an if and only if because not all Mersenne primes have this property, but what if having this property guarantees it is a Mersenne prime?
It fails at 1, 15, 23, 27, 37, 39, 43, 55, 58, 63, 71, 79, 82, 91, 95, 111, 123, 133, 135, 139, 143, 148, 151, 159, 167, 169, 172, 173, 175, 179, 183, 191, 195, 199, 207, 211, 223, 239, 255, 286, 295, 313, 316, 319, 335, 337, 351, 367, 373, 383, 406, 415, 417, 433, 435, 447, 455, 461, 463, 479, 483, 487, 493, 495, 497, 505, 511, 517, 523, 527, 543, 551, 559, 571, 575, 578, 583, 587, 591, 599, 603, 615, 623, 635, 639, 643, 651, 655, 671, 673, 679, 682, 687, 703, 711, 715, 735, 739, 742, 745, 751, 767, 771, 783, 787, 799, 803, 805, 807, 811, 815, 823, 827, 831, 839, 847, 863, 867, 871, 887, 895, 911, 915, 923, 927, 943, 959, 963, 967, 975, 991, 999, ...
Thanks from numberguru1
CRGreathouse is offline  
October 16th, 2015, 07:58 AM   #19
Banned Camp
 
Joined: Dec 2013

Posts: 1,117
Thanks: 41

Quote:
Originally Posted by CRGreathouse View Post
I'd be happy to try -- I have some ideas in mind -- but I'll need a definition of "NON TRIVIAL" first.
(k*10.000!)+1 is a trivial one
mobel is offline  
October 16th, 2015, 08:22 AM   #20
Global Moderator
 
CRGreathouse's Avatar
 
Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Quote:
Originally Posted by mobel View Post
(k*10.000!)+1 is a trivial one
I was hoping for a definition rather than an example. I don't want to spend time on the problem until I know what it is.
CRGreathouse is offline  
Reply

  My Math Forum > College Math Forum > Number Theory

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 11:51 AM
Conjecture about primes of a special form Sebastian Garth Number Theory 9 November 22nd, 2013 03:38 PM
Conjecture on cycle length and primes : prime abc conjecture miket Number Theory 5 May 15th, 2013 06:35 PM
Twin primes conjecture ibougueye Number Theory 1 August 13th, 2012 09:24 PM
New conjecture about primes ? Bogauss Number Theory 32 March 1st, 2012 07:30 AM





Copyright © 2018 My Math Forum. All rights reserved.