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

 Showing results 1 to 25 of 1000 Search took 0.19 seconds. Search: Posts Made By: Citrix
 Forum: GPU Computing 2021-12-25, 11:26 Replies: 40 Views: 28,274 Posted By Citrix I appreciate your efforts. I am looking to work... I appreciate your efforts. I am looking to work on larger 32 bit bases and not larger 64 bit exponents. For example, the current program cannot handle factoring 10000001^999431+-1 I just wanted to...
 Forum: GPU Computing 2021-12-19, 03:42 Replies: 40 Views: 28,274 Posted By Citrix Can you compile a generalized version that can... Can you compile a generalized version that can work for any base (positive or negative) with no limits on the size of the base (<32 bits). If it does not calculate the remainders (Legendre/Jacobi...
 Forum: Software 2021-11-07, 03:11 Replies: 634 Views: 102,181 Posted By Citrix It was under a different license before. Maybe... It was under a different license before. Maybe this would be helpful:- https://github.com/curtisseizert/CUDASieve
 Forum: Software 2021-10-27, 03:02 Replies: 634 Views: 102,181 Posted By Citrix The license prevents us from changing the code.... The license prevents us from changing the code. You could write a faster Sieve of Eratosthenes if you let a few composites slip through. You can get 60MP/sec for 4 cores.
 Forum: Software 2021-10-26, 04:46 Replies: 634 Views: 102,181 Posted By Citrix The "Sieve of Eratosthenes" code becomes a bottle... The "Sieve of Eratosthenes" code becomes a bottle neck around 10-15 Mp/sec.
 Forum: Software 2021-06-28, 04:21 Replies: 482 Views: 70,584 Posted By Citrix If doing P-1 work on (k^p-1)/(k-1) or... If doing P-1 work on (k^p-1)/(k-1) or (k^p+1)/(k+1) with p prime Does Prime95 automatically includes p in the B1 stage? Thanks
 Forum: Forum Feedback 2021-06-26, 17:55 Replies: 33 Views: 4,329 Posted By Citrix Can we change back to the old font? Can we change back to the old font?
 Forum: Puzzles 2021-06-06, 05:55 Replies: 20 Views: 4,739 Posted By Citrix In worst case scenario this can be solved in ~... In worst case scenario this can be solved in ~ N^2 tries. The faster practical solution (not sure if this is allowed) is to create a hash table and assign each unique letter a number. Set the...
 Forum: Software 2021-01-11, 01:35 Replies: 634 Views: 102,181 Posted By Citrix I am getting a speed of 4kp/sec for 11 sequences... I am getting a speed of 4kp/sec for 11 sequences from n=1M to 20M. Sr2sieve and srsieve2 are both significantly faster. Is this what is expected?
 Forum: Puzzles 2021-01-05, 07:03 Replies: 13 Views: 3,089 Posted By Citrix Sum of n consecutive numbers==> (n / 2) *(first... Sum of n consecutive numbers==> (n / 2) *(first number + last number) = sum Last number=first number +n-1 n*(2*first number +n-1)-2*sum=0 first number =f n^2+(2*f-1)*n-2*sum=0 This is a...
 2020-12-22, 02:18 Replies: 8 Views: 1,522 Posted By Citrix https://harvey563.tripod.com/ These are... https://harvey563.tripod.com/ These are called Generalized HyperCulllen/Woodall.
 Forum: Software 2020-12-03, 04:52 Replies: 4 Views: 1,933 Posted By Citrix srsieve can handle multiple base 10 sequences at... srsieve can handle multiple base 10 sequences at once. eg) srsieve.exe --pfgw --nmin 1 --nmax 10000 --pmin 1 --pmax 10000 --factors "3*10^n+1" "2*10^n-1"
 Forum: Puzzles 2020-10-23, 06:41 Replies: 31 Views: 6,875 Posted By Citrix Cannot say about the origin. The badge could... Cannot say about the origin. The badge could belong to a group, trade organization etc. It could just be for decorative purposes. Oil lamp = Service Lightning bolt= Illumination Statue of...
 Forum: Puzzles 2020-10-02, 05:47 Replies: 34 Views: 9,195 Posted By Citrix Possible hint if I understand the question... Possible hint if I understand the question correctly (I agree that the language is not very clear). Hint:...
 Forum: Software 2020-09-24, 05:31 Replies: 125 Views: 36,263 Posted By Citrix I tried to replace mulmod by powmod to avoid... I tried to replace mulmod by powmod to avoid unnecessary multiplication. I get an error during run time. Any idea why the calculations are not being done correctly? void ...
 Forum: Software 2020-09-24, 03:45 Replies: 125 Views: 36,263 Posted By Citrix Robert, I think you are correct. I came to the... Robert, I think you are correct. I came to the same conclusion when reviewing the code. Though for sr1sieve there would not be any need to calculate b^d (mod p) for particular d values as there is no...
 Forum: Software 2020-09-21, 17:26 Replies: 125 Views: 36,263 Posted By Citrix I am looking at BestQ code uint32_t ... I am looking at BestQ code uint32_t GenericSubsequenceHelper::RateQ(uint32_t Q, uint32_t s) { uint32_t baby, giant, work; ChooseSteps(&baby, &giant, Q, s);
 Forum: Software 2020-08-22, 03:48 Replies: 125 Views: 36,263 Posted By Citrix I modified sr1sieve to read any Q from command... I modified sr1sieve to read any Q from command line and got significant benefit for low weight series. I am trying to combine the benefit with your faster FPU/AVX code. The problem modifying...
 Forum: Software 2020-08-22, 02:12 Replies: 125 Views: 36,263 Posted By Citrix Calculating best Q for srsieve2.exe Moving this from the other thread: A faster automated way of finding the bestQ would be 1) Set BASE_MULTIPLE to the gcd of differences of all consecutive terms left For N1, N2, N3, N4, ......
 Forum: Software 2020-08-18, 23:02 Replies: 634 Views: 102,181 Posted By Citrix All candidates in post below need Q >720 ... All candidates in post below need Q >720 https://www.mersenneforum.org/showpost.php?p=355682&postcount=4 You can read the posts in the above thread (towards the end). We were finding benefit of...
 Forum: Software 2020-08-18, 17:53 Replies: 634 Views: 102,181 Posted By Citrix Feature request for srsieve2.exe In... Feature request for srsieve2.exe In CisOneSubsequenceHelper.cpp can you create an option to bypass the code to calculate the ii_BestQ if the user can use the -Q flag and specify it from the...
 Forum: Math 2020-08-05, 05:31 Replies: 23 Views: 14,048 Posted By Citrix Thinking about this further... all primes in B1... Thinking about this further... all primes in B1 are not necessary and it does not need to be an absolute multiple of powersmooth(1000000). Some primes can be twice, some three times etc. Turning...
 Forum: Puzzles 2020-08-05, 03:57 Replies: 28 Views: 15,012 Posted By Citrix This should follow a binomial distribution-I... This should follow a binomial distribution-I suspect. Though no proof as bits are not independent.
 Forum: Math 2020-08-05, 03:16 Replies: 23 Views: 14,048 Posted By Citrix Your idea seems interesting! If we could... Your idea seems interesting! If we could find a N with low hammer weight then we can use it for testing all p-1 candidates again and again so this would be useful. We could use dynamic programming...
 Forum: Miscellaneous Math 2020-08-02, 07:25 Replies: 14 Views: 5,925 Posted By Citrix N~ 100,000 bits + m <1000 We could also... N~ 100,000 bits + m <1000 We could also define k and c to be less than 2^64.
 Showing results 1 to 25 of 1000

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

Tue May 24 15:19:17 UTC 2022 up 40 days, 13:20, 0 users, load averages: 2.02, 1.99, 1.93