View Single Post
Old 2013-08-12, 14:24   #3
Thomas11
 
Thomas11's Avatar
 
Feb 2003

22·32·53 Posts
Default

Hi Citrix,

I'm glad to see that you generated a new bunch of ultra low weight Ks.

Quote:
Originally Posted by Citrix View Post
Here is one example. (I can share more if any one needs them)
k=6642510166838280632766408995039562371
Covering set=61130828015333178565632041818522446870
n=103680

You can generate more k's by
k=k+covering set *y
Given the large covering set (3, 5, 7, 11, 13, 17, 19, 31, 37, 41, 61, 97, 163, 193, 271, 541, 641, 769, 1297, 7681), which leaves only 1/103680th of the candidates, it is actually not surprising that you're left with only one candidate per million after sieving.

Note that there are many more cycles sharing the same covering set. Thus, your starting k (k0) is only one out of many.
Here are a few more:
13349413408324173624146033148581
53562291021239919328906722016303
156820614115299139492807442264081
Thomas11 is offline   Reply With Quote