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

 Showing results 1 to 25 of 1000 Search took 0.26 seconds. Search: Posts Made By: Citrix
 Forum: Puzzles 2020-03-21, 15:18 Replies: 6 Views: 608 Posted By Citrix For k=3 S(0)=0 S(1)=(1-0)/3=1/3 ... For k=3 S(0)=0 S(1)=(1-0)/3=1/3 S(2)=(1-1/3)/3=2/9 S(3)=(1-2/9)/3=7/27 ... Hope this helps
 Forum: Puzzles 2020-03-21, 03:31 Replies: 6 Views: 608 Posted By Citrix Sequence For a given integer k, the sequence is defined as :- S(0)=0 S(n)=(1-S(n-1))/k What is the formula for the nth term? Show that for large values of n the nth term converges on 1/(k+1) for k>1 ...
 Forum: GPU Computing 2019-11-03, 05:39 Replies: 21 Views: 1,923 Posted By Citrix 3 questions 1) Were you able to figure out the... 3 questions 1) Were you able to figure out the Legendre/Jacobi symbols to filter primes for all bases. 2) Is there a reason the app would crash for large bases >100,000? 3) Are negative bases...
 Forum: Software 2019-10-27, 22:21 Replies: 292 Views: 18,593 Posted By Citrix Srxsieve also misses this at times. As it only... Srxsieve also misses this at times. As it only looks at x=factors of 720.
 Forum: Software 2019-10-27, 15:20 Replies: 292 Views: 18,593 Posted By Citrix Yes this is correct. For a range of n=1 to... Yes this is correct. For a range of n=1 to 1000000 the discrete log would have 1000 BS and 1000 GS If we know x =16 Then the range becomes n=1 to 62500 (for base b^16) and the discrete log...
 Forum: Software 2019-10-27, 00:49 Replies: 292 Views: 18,593 Posted By Citrix I am interested in low weight numbers of the form... I am interested in low weight numbers of the form k*b^n+-1 with fixed k and b and variable n. (srsieve2.exe) Is it possible to add support for large bases where b'=b^x and large k values where...
 2019-05-06, 01:52 Replies: 8 Views: 393 Posted By Citrix An interesting side project would be searching... An interesting side project would be searching for k=1 Choosing b such that b^(2^(n-1))+1 is also prime Then b^(2^n)-2 could easily be proven prime as more than 50% of the N+1 can be factorized. ...
 Forum: Riesel Prime Search 2018-12-26, 02:50 Replies: 9 Views: 1,586 Posted By Citrix You can use the search function on the website.... You can use the search function on the website. Includes some primes in 2017 - as I used 365 days from today as the search option. ----- -------------------------------- ------- ----- ----...
 Forum: Software 2018-09-18, 00:59 Replies: 9 Views: 1,484 Posted By Citrix I have attached version 1.3 32 bit. This should... I have attached version 1.3 32 bit. This should work on windows 98. Hope this helps.
 Forum: GPU Computing 2018-09-14, 20:14 Replies: 3,245 Views: 252,279 Posted By Citrix Thanks. I would need windows, I do not have... Thanks. I would need windows, I do not have linux. :no: I will wait, I am not in a hurry.
 Forum: GPU Computing 2018-09-14, 19:49 Replies: 3,245 Views: 252,279 Posted By Citrix I am more interested in the case where n=1.... I am more interested in the case where n=1. Looking at the factors of these numbers they are 1 and 7 (mod 8). I do not know how to prove this. If you could compile a version that just restricts...
 Forum: GPU Computing 2018-09-13, 19:39 Replies: 3,245 Views: 252,279 Posted By Citrix I am working on numbers such that b^p+-1 where p... I am working on numbers such that b^p+-1 where p is an odd prime and b=n*p and n is a natural number. From your example the Legendre (b,p)= Legendre (n*p,p)=Legendre (0,p)=0 How do we proceed...
 Forum: GPU Computing 2018-09-13, 15:16 Replies: 3,245 Views: 252,279 Posted By Citrix For generalized repunits b^p-1 (also for b^p+1... For generalized repunits b^p-1 (also for b^p+1 i.e. for negative b) with p prime, they have factors of the form 2*k*p+1 irrespective of b. The only question is what form these factors can take mod...
 Forum: GPU Computing 2018-09-12, 16:16 Replies: 3,245 Views: 252,279 Posted By Citrix Can Mfaktc be modified to support Generalized... Can Mfaktc be modified to support Generalized repunit (https://primes.utm.edu/top20/page.php?id=16) trial factoring. The algebraic factors would be similar to mersenne numbers. Any help would be...
 Forum: Software 2018-09-09, 05:38 Replies: 441 Views: 46,706 Posted By Citrix How do I use this setting? Thank you ATH,... How do I use this setting? Thank you ATH, your option should also work.
 Forum: Software 2018-09-09, 03:58 Replies: 441 Views: 46,706 Posted By Citrix I am doing some ECM/P-1 work on numbers of the... I am doing some ECM/P-1 work on numbers of the form b^n+-1. Some of these numbers have known small factors. When I use a large B1 -- most of these small factors are found in the B1 stage and the...
 Forum: Math 2018-09-09, 03:52 Replies: 2 Views: 712 Posted By Citrix For k*b^n+-1, I think you are talking about fixed... For k*b^n+-1, I think you are talking about fixed b and n and variable k? Some of this is randomness involved with distribution of factors. When n has a lot of small factors and k is a power...
 Forum: Lounge 2018-09-07, 06:02 Replies: 19 Views: 9,700 Posted By Citrix You could use... You could use :https://chrome.google.com/webstore/detail/copyfish-%F0%9F%90%9F-free-ocr-soft/eenjdnjldapjajjofmldgmkjaienebbj?hl=en There are similar software in the Chrome app store if you search...
 Forum: Homework Help 2018-07-01, 09:09 Replies: 12 Views: 2,631 Posted By Citrix Starting with $200 Assuming that at n turns the... Starting with$200 Assuming that at n turns the game stops then n=x+200 losses and x wins (min n=200) Or n=x looses and x + 300 wins (min n=300) Also note that n must be even Odd of this...
 Forum: Software 2018-05-11, 03:24 Replies: 441 Views: 46,706 Posted By Citrix Unfortunately there aren't any. Unfortunately there aren't any.
 Forum: Software 2018-05-11, 03:12 Replies: 441 Views: 46,706 Posted By Citrix Is it possible to do trial factoring on non-base... Is it possible to do trial factoring on non-base 2 numbers e.g. 3^p+-1 using Prime95? Thanks.
 2018-05-06, 02:12 Replies: 7 Views: 1,424 Posted By Citrix How did you extend these ranges? Is there a good... How did you extend these ranges? Is there a good sieve software and fast PRP software. If you used PFGW - what setting did you use? Thanks.
 2018-04-21, 01:08 Replies: 11 Views: 1,742 Posted By Citrix I have extended this to n=250K, without a sieve... I have extended this to n=250K, without a sieve it is hard to extend this further.
 2018-04-15, 00:03 Replies: 11 Views: 1,742 Posted By Citrix Thank you for pointing out mtsieve. (I did not... Thank you for pointing out mtsieve. (I did not know about this before :( ) There is something called modular exponentiation which will calculate k%p very fast. Calculating k%p will take very...
 2018-04-13, 02:59 Replies: 11 Views: 1,742 Posted By Citrix Is someone able to modify srsieve to sieve for... Is someone able to modify srsieve to sieve for...
 Showing results 1 to 25 of 1000

All times are UTC. The time now is 15:06.

Wed Apr 1 15:06:18 UTC 2020 up 7 days, 12:39, 1 user, load averages: 1.37, 1.35, 1.31