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

 Showing results 1 to 13 of 13 Search took 0.01 seconds. Search: Posts Made By: Citrix
 Forum: Open Projects 2006-08-07, 21:04 Replies: 55 Views: 33,679 Posted By Citrix b=127 has been checked by RPS to 575K. So no need... b=127 has been checked by RPS to 575K. So no need to waste time there.
 Forum: Open Projects 2006-08-02, 01:19 Replies: 55 Views: 33,679 Posted By Citrix I think the limit is 2^31-1. I tried sieving... I think the limit is 2^31-1. I tried sieving k=2249392549 using your program it completely screws the k up, printing incorrect factors etc. If the limit is really 2^32 then I think this is a bug.
 Forum: Open Projects 2006-07-28, 04:48 Replies: 55 Views: 33,679 Posted By Citrix The alogrithm is the same as... The alogrithm is the same as baby-steps-giant-steps algorithm only done in groups of factors of p-1, than based on sqrt of the range of n's. so if p-1=2*a*b then running time is...
 Forum: Open Projects 2006-07-26, 17:18 Replies: 55 Views: 33,679 Posted By Citrix I noticed that your program does not use the SPH... I noticed that your program does not use the SPH algorithm. Do you have any plans of implementing it. It is quite straight forward. It should make your program several times faster. It is...
 Forum: Open Projects 2006-07-26, 07:37 Replies: 55 Views: 33,679 Posted By Citrix OK I will stick with this k and not go beyond... OK I will stick with this k and not go beyond 2^32 GFNsieve and AthGFNsieve only work with bases<2^32. For me the base is as large as 2^125,000. So I don't think they will work. Thanks once...
 Forum: Open Projects 2006-07-26, 04:33 Replies: 55 Views: 33,679 Posted By Citrix Thank you for the excellent work. I am getting... Thank you for the excellent work. I am getting around 7000 kp/sec for the 3^16 sequence. That is 3.5 times faster than newpgen or jjsieve.:showoff: :bow: Is there a limit on the size of the k,...
 Forum: Open Projects 2006-07-25, 22:59 Replies: 55 Views: 33,679 Posted By Citrix I am not completely sure, but I think jjsieve... I am not completely sure, but I think jjsieve already does this for me. k=25 seems faster to sieve than k=5. So I think you do not have to implement anything. I think when you do discrete log,...
 Forum: Open Projects 2006-07-25, 05:37 Replies: 55 Views: 33,679 Posted By Citrix NO problem, I plan to do several of them. ... NO problem, I plan to do several of them. http://www.mersenneforum.org/showthread.php?t=6038
 Forum: Open Projects 2006-07-22, 04:47 Replies: 55 Views: 33,679 Posted By Citrix Geoff, A quick question for you. If you... Geoff, A quick question for you. If you consider 4*5^n+1. All n's left after sieving till 3 are multiples of 2 ie. all numbers left are x^2+1. Note that numbers of the form x^(2^y)+1 are...
 Forum: Open Projects 2006-07-21, 21:15 Replies: 55 Views: 33,679 Posted By Citrix Your proof is interesting, but flawed. ... Your proof is interesting, but flawed. 1=(b-1)*b^((p_i-1)*c-1) mod p_i (for some positive integer c) C does not exist for all p_i. Hence these p_i can form the covering set. Your proof if it...
 Forum: Open Projects 2006-07-21, 15:53 Replies: 55 Views: 33,679 Posted By Citrix Could you post this or PM it to me? Thank... Could you post this or PM it to me? Thank you.
 Forum: Open Projects 2006-07-17, 14:30 Replies: 55 Views: 33,679 Posted By Citrix I will try working on this, to see if I can find... I will try working on this, to see if I can find the sierpinki or riesel numbers. I leave 4*5^n-1 for you. Thankyou.
 Forum: Open Projects 2006-07-16, 16:45 Replies: 55 Views: 33,679 Posted By Citrix I am interested in helping out. But what is the... I am interested in helping out. But what is the open problem related to these numbers? what is the weight of these numbers? Have you tried to search (b-1)*b^n+1? For fixed n and variable b. Can...
 Showing results 1 to 13 of 13

All times are UTC. The time now is 11:08.

Thu Jan 27 11:08:31 UTC 2022 up 188 days, 5:37, 1 user, load averages: 1.28, 1.39, 1.35