mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 8 of 8 Search took 0.01 seconds. Search: Posts Made By: Citrix
 Forum: Open Projects 2013-08-24, 05:24 Replies: 18 Views: 12,544 Posted By Citrix Complete to 100K. continuing. I have written a... 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:bow:
 Forum: Open Projects 2013-08-15, 22:15 Replies: 18 Views: 12,544 Posted By Citrix ((((((((((((((((1*2^1+1)*2^1+1)*2^2+1)*2^1+1)*2^5+... ((((((((((((((((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...
 Forum: Open Projects 2013-07-31, 01:51 Replies: 18 Views: 12,544 Posted By Citrix FYI: I have finished this to n=130,000 with no... FYI: I have finished this to n=130,000 with no primes....
 Forum: Open Projects 2013-07-09, 15:36 Replies: 18 Views: 12,544 Posted By Citrix That is because of 11 being a factor of base-1. ... 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) ABC2...
 Forum: Open Projects 2013-07-08, 23:46 Replies: 18 Views: 12,544 Posted By Citrix Looking more into this: Find bases such that... 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...
 Forum: Open Projects 2013-07-08, 19:36 Replies: 18 Views: 12,544 Posted By Citrix Thanks! I tried your script for k=1 and... Thanks! I tried your script for k=1 and base=30, tested upto 40,000 bits but it has not turned into trivial candidates yet. For base=2 it crashed on me. I am trying it again. Can we develop some...
 Forum: Open Projects 2013-07-08, 16:55 Replies: 18 Views: 12,544 Posted By Citrix Could you share your PFGW script with me. I was... Could you share your PFGW script with me. I was getting errors with PFGW when I programmed it. I would like to extend the series higher. What bases give trivial factors for k=1? :smile:
 Forum: Open Projects 2013-07-06, 18:43 Replies: 18 Views: 12,544 Posted By Citrix Prime generating series Question: Are there finite terms in these sequence? Sierpinski:1, 1, 2, 1, 5, 1, 1, 29, 3, 37, 31, 227, 835, 115 Riesel: 2, 1, 2, 1, 1, 7, 15, 35, 619, 2191, 1267, 187 Checked up to 5000 bits. ...
 Showing results 1 to 8 of 8

All times are UTC. The time now is 10:54.

Fri Dec 3 10:54:41 UTC 2021 up 133 days, 5:23, 0 users, load averages: 0.86, 1.13, 1.20