mersenneforum.org Search Results
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 5 of 5 Search took 0.00 seconds. Search: Posts Made By: robert44444uk
 Forum: Conjectures 'R Us 2008-11-06, 12:39 Replies: 115 Views: 38,497 Posted By robert44444uk Gary Clumsy of me, the theory maintains that... Gary Clumsy of me, the theory maintains that Fermat and GFN factors are key (not as stated), to find a specific, but not necessarily efficient b for any value of k, except k=1 or k=Mersenne. ...
 Forum: Conjectures 'R Us 2008-11-06, 07:24 Replies: 115 Views: 38,497 Posted By robert44444uk Sorry for misleading if it is 64-cover - should... Sorry for misleading if it is 64-cover - should have checked! There is unpublished work in this area, and for this reason I cannot really go into details on why these factorisations are key as it...
 Forum: Conjectures 'R Us 2008-11-04, 04:31 Replies: 115 Views: 38,497 Posted By robert44444uk Somebody should also be looking at the theory -... Somebody should also be looking at the theory - by checking higher (x^2)^2-1 factorisations, to see whether a smaller k is feasible, by running through bigcover.exe
 Forum: Conjectures 'R Us 2008-11-03, 03:06 Replies: 115 Views: 38,497 Posted By robert44444uk This k was generated from looking at (x^2)^n-1... This k was generated from looking at (x^2)^n-1 factorisations -covering set is 3,5,17,257,641,65537,6700417 which I think is 32-cover. I do not think anyone has claimed it is the smallest k, it just...
 Forum: Conjectures 'R Us 2008-06-02, 13:16 Replies: 115 Views: 38,497 Posted By robert44444uk For the infinity of bases, the smallest... For the infinity of bases, the smallest Sierpinski k may take any integer value except 2^x-1, x=integer. There are generating functions to discover instances of certain values such as k=2,5,65...
 Showing results 1 to 5 of 5

All times are UTC. The time now is 14:22.

Sat Nov 27 14:22:07 UTC 2021 up 127 days, 8:51, 0 users, load averages: 0.80, 1.07, 1.03