 mersenneforum.org Prime generating series
 Register FAQ Search Today's Posts Mark Forums Read  2013-07-08, 23:46 #12 Citrix   Jun 2003 158210 Posts Looking more into this: Find bases such that base+1 and base-1 are not smooth. Otherwise you easily get trivial factors. Related question: For each base find the lowest starting term that results in trivial factors. What is the lowest one for 2?    2013-07-09, 01:14 #13 science_man_88   "Forget I exist" Jul 2009 Dumbassville 26×131 Posts Code:  for(k=1,100000000000000,for(n=1,1000000000,if(isprime(k*2^n+1),print1(n",");k=k*2^n;break()))) is the brute force script I sent to Citrix through PM after this thread started, I know of a few tweaks I just can't get all them to work ( like eliminating n based on k, 2^n fall into two categories mod 6 2 and 4 so I tried to use ifs to control the n searched for each k but I can't get it to work). I know the multiplies by 2^n can be made into bitshift k< 2013-07-09, 09:47 #14 henryzz Just call me Henry   "David" Sep 2007 Cambridge (GMT/BST) 2×32×7×47 Posts With PFGW I don't really think it is worth bothering with that sort of thing. Almost all the time is spent trial factoring the candidates with large factors and prp testing them. Calculating the candidates is trivial.   2013-07-09, 14:21 #15 henryzz Just call me Henry   "David" Sep 2007 Cambridge (GMT/BST) 2×32×7×47 Posts Base 12 with prime b+1, b-1 ends in a trivial factor for k=1 c=+1 http://factordb.com/index.php?query=...at=1&sent=Show Base 2 gets off lighter because it doesn't matter if every term is divisible by b-1=1. b=12, k=1, c=-1 hasn't terminated yet for me.   2013-07-09, 15:36   #16
Citrix

Jun 2003

30568 Posts Quote:
 Originally Posted by henryzz Base 12 with prime b+1, b-1 ends in a trivial factor for k=1 c=+1 http://factordb.com/index.php?query=...at=1&sent=Show Base 2 gets off lighter because it doesn't matter if every term is divisible by b-1=1. b=12, k=1, c=-1 hasn't terminated yet for me.
That is because of 11 being a factor of base-1.
FYI: I tested b=2, k=1, c=1 further upto 65,000 bits... no primes. This is how I did it with the (-f Flag)

Code:
ABC2 ((((((((((((((((1*2^1+1)*2^1+1)*2^2+1)*2^1+1)*2^5+1)*2^1+1)*2^1+1)*2^29+1)*2^3+1)*2^37+1)*2^31+1)*2^227+1)*2^835+1)*2^115+1)*2^7615+1)*2^6071+1)*2^$a+1 a: from 1 to 50000 If there was some way of sieving this series, we can go deeper. Last fiddled with by Citrix on 2013-07-09 at 15:37   2013-07-31, 01:51 #17 Citrix Jun 2003 2·7·113 Posts Quote:  Originally Posted by Citrix That is because of 11 being a factor of base-1. FYI: I tested b=2, k=1, c=1 further upto 65,000 bits... no primes. This is how I did it with the (-f Flag) Code: ABC2 ((((((((((((((((1*2^1+1)*2^1+1)*2^2+1)*2^1+1)*2^5+1)*2^1+1)*2^1+1)*2^29+1)*2^3+1)*2^37+1)*2^31+1)*2^227+1)*2^835+1)*2^115+1)*2^7615+1)*2^6071+1)*2^$a+1 a: from 1 to 50000 If there was some way of sieving this series, we can go deeper.
FYI: I have finished this to n=130,000 with no primes....   2013-08-15, 22:15 #18 Citrix   Jun 2003 30568 Posts Code: ((((((((((((((((1*2^1+1)*2^1+1)*2^2+1)*2^1+1)*2^5+1)*2^1+1)*2^1+1)*2^29+1)*2^3+1)*2^37+1)*2^31+1)*2^227+1)*2^835+1)*2^115+1)*2^7615+1)*2^6071+1)*2^218431+1 is prime! Checked to n=40,000 after that. The nash weight of this new number is even lower. Last fiddled with by Citrix on 2013-08-15 at 22:16   2013-08-24, 05:24 #19 Citrix   Jun 2003 62E16 Posts Complete to 100K. continuing. I have written a sieve for these numbers... so things are easier now. Could one of the moderators move this thread to the open projects section. Thx    Thread Tools Show Printable Version Email this Page Similar Threads Thread Thread Starter Forum Replies Last Post Orgasmic Troll Math 61 2017-04-05 19:28 SteveC Analysis & Analytic Number Theory 10 2016-10-14 21:48 spkarra Miscellaneous Math 3 2009-12-29 00:23 Wacky Puzzles 46 2005-06-05 22:19 Orgasmic Troll Math 28 2004-12-02 16:37

All times are UTC. The time now is 02:07.

Tue Oct 26 02:07:48 UTC 2021 up 94 days, 20:36, 0 users, load averages: 1.99, 1.62, 1.42