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

 Showing results 1 to 25 of 422 Search took 0.06 seconds. Search: Posts Made By: bur
 Forum: Proth Prime Search 2021-12-02, 17:33 Replies: 22 Views: 7,164 Posted By bur Thanks, I had thought about using the GPU since... Thanks, I had thought about using the GPU since at Primegrid sieving Proth numbers with GPU is much faster than any CPU. The reason I didn't was that I only have a GTX 760 and a GTX 1660. The 760 is...
 Forum: Riesel Prime Search 2021-12-02, 17:28 Replies: 101 Views: 27,680 Posted By bur How to proceed (sieve, LLR, P-1) depends on which... How to proceed (sieve, LLR, P-1) depends on which method removes candidates faster. For sieving that's a bit hard to determine since it removes an n=10M almost as fast as n=1M while the LLR of the...
 Forum: Lone Mersenne Hunters 2021-12-02, 08:13 Replies: 1,986 Views: 271,869 Posted By bur My first P+1 factor and even a relatively large... My first P+1 factor and even a relatively large one and a relatively smooth one and of a relatively small Mersenne number: M211231 (https://www.mersenne.ca/exponent/211231) Start=2/7,...
 Forum: Data 2021-11-30, 14:40 Replies: 120 Views: 10,589 Posted By bur I was after finding a factor with P+1 and using... I was after finding a factor with P+1 and using the script to come up with candidates and B1 a factor was found today: M211231 (https://www.mersenne.ca/exponent/211231) Start=2/7, B1=150,000,000,...
 Forum: Miscellaneous Math 2021-11-27, 07:53 Replies: 10 Views: 622 Posted By bur Interesting idea, I tried to find an example for... Interesting idea, I tried to find an example for d_s > 6 but there were none up to d_s = 102. I only tested the smallest possible C with that d_s. I did the search manually though as I was too...
 Forum: Homework Help 2021-11-26, 14:32 Replies: 24 Views: 4,280 Posted By bur And another one: Show that {p-1\choose... And another one: Show that {p-1\choose k}\equiv -1^k \pmod p It probably shouldn't use Wilson's theorem since that only comes in the next section in the book. I tried to write it as a...
 2021-11-26, 06:57 Replies: 71 Views: 8,664 Posted By bur To be honest, I also don't get it. The search... To be honest, I also don't get it. The search limit is 10,800,000 but some numbers in the 6-8M range have not been checked yet (or at least it's not documented).
 Forum: Proth Prime Search 2021-11-22, 16:32 Replies: 22 Views: 7,164 Posted By bur Once again, a status update with no new prime: ... Once again, a status update with no new prime: Sieving All n < 10,000,000 have been sieved to 800e12. Last reported time per factor: approx. 12,000 s 76,167 candidates (1.6%) are left in the...
 Forum: Homework Help 2021-11-21, 05:54 Replies: 24 Views: 4,280 Posted By bur I know, I wrote just that... ;) I didn't... I know, I wrote just that... ;) I didn't think of that. But in that case it still only works for powers of 2 as factors. Thanks, this is the answer to my question, but seeing it, I think...
 Forum: Homework Help 2021-11-20, 08:26 Replies: 24 Views: 4,280 Posted By bur Another problem came up. The exercises deal with... Another problem came up. The exercises deal with showing that a^x is congruent to 1 (or a) mod c, where c is a composite number: a^21 == a (mod 15) for all a This is not a problem yet, but what...
 Forum: Data 2021-11-17, 19:00 Replies: 79 Views: 8,962 Posted By bur Old thread, but at least somewhat connected to my... Old thread, but at least somewhat connected to my question: I just got assigned a C-PRP on a number below the wavefront and saw the factor in question should have been found by P-1 20 years ago....
 2021-11-17, 11:28 Replies: 71 Views: 8,664 Posted By bur When looking at the stats... When looking at the stats (https://www.kurtbeschorner.de/#rprimes) I noticed that the ranges 6M-7M and 7M-8M are not yet 100% completed but have a few exponents with status "unknown". Is there a...
 Forum: Data 2021-11-12, 16:39 Replies: 120 Views: 10,589 Posted By bur Ok, thanks. And one more question, this time... Ok, thanks. And one more question, this time hopefully a genuine problem: the script chose various P-1 jobs with B1 smaller than the actual work done. For example M52757...
 Forum: Data 2021-11-11, 11:48 Replies: 120 Views: 10,589 Posted By bur Some more testing revealed that indeed the size... Some more testing revealed that indeed the size of the exponent determines whether or not the worker will run multithreaded. Is that a bug?
 Forum: Data 2021-11-11, 08:38 Replies: 120 Views: 10,589 Posted By bur I have a problem with multithreading. Initially I... I have a problem with multithreading. Initially I was running P+1 with 2 workers on exponents in the 10^6 range and each worker ran 5 threads, fully utilizing the 10-core CPU. Then I added some 50000...
 Forum: Data 2021-11-08, 21:33 Replies: 120 Views: 10,589 Posted By bur Finally figured it out, I had to update to 30.6... Finally figured it out, I had to update to 30.6 ... I tried using the script to get P+1 to run, but I only get "illegal line in worktodo.txt" for each line. Doesn't matter whether I put them...
 Forum: Software 2021-11-06, 06:36 Replies: 304 Views: 68,159 Posted By bur That means it's 5% slower but allows for p up to... That means it's 5% slower but allows for p up to 2^64? So if I don't need such large p, I'd better use the older version? Or is it only slower if you actually use p > 2^52?
 Forum: Math 2021-11-01, 19:28 Replies: 10 Views: 2,289 Posted By bur I know this thread is old, but I couldn't find... I know this thread is old, but I couldn't find any other explanation more detailed than A 41 digits for M14731 (https://www.mersenne.org/report_exponent/?exp_lo=14731&full=1) was found via ECM...
 Forum: Software 2021-10-30, 06:11 Replies: 1 Views: 125 Posted By bur pfgw factorial testing too slow? I had done some factorial prime testing with PRPnet (http://prpnet.primegrid.com:12002/server_stats.html) with i5 and i3 CPUs before and a test took about 25-30 hours. Now recently I began testing...
 Forum: Riesel Prime Search 2021-10-25, 17:34 Replies: 290 Views: 51,757 Posted By bur Thanks for moving the post. Who knows, it's not... Thanks for moving the post. Who knows, it's not like where GIMPS is currently at where 20M+ consecutive candidates are composite - at least I don't think so. I always forget the estimate for...
 Forum: Lone Mersenne Hunters 2021-10-24, 11:56 Replies: 1,986 Views: 271,869 Posted By bur Nothing spectacular, but the first P-1 tests I... Nothing spectacular, but the first P-1 tests I did in a while and the first to finish stage 1 returned: [Worker #3 Oct 24 07:53] P-1 found a factor in stage #1, B1=779000. [Worker #3 Oct 24...
 Forum: Riesel Prime Search 2021-10-22, 17:44 Replies: 290 Views: 51,757 Posted By bur New Primorial Prime found Recently a new -1 type primorial prime was found at PRPNet. 3267113# - 1 (https://primes.utm.edu/primes/page.php?id=132758) It has 1418398 digits, making it the largest known one. The last -1...
 Forum: CADO-NFS 2021-10-22, 17:17 Replies: 72 Views: 14,320 Posted By bur I finished the uniques ratio for a large set of... I finished the uniques ratio for a large set of different q-min/q-max settings. The data is attached as an xslx file, zipped since for some reason the forum software didn't like the file....
 Forum: Factoring 2021-10-18, 16:17 Replies: 60 Views: 5,045 Posted By bur Once again the factoring times increased... Once again the factoring times increased significantly. I'm at 1281979*2^632+1 and the 179 digits co-factor took nearly 24 hours. I used the optimized c140 params as basis with slightl adjustment as...
 Forum: Proth Prime Search 2021-10-11, 07:14 Replies: 6 Views: 1,034 Posted By bur Interesting, I didn't know about Pierpont primes.... Interesting, I didn't know about Pierpont primes. Did you check for ((x)G))F divisibility? The chances are slim, but you never know...
 Showing results 1 to 25 of 422

All times are UTC. The time now is 00:50.

Sat Dec 4 00:50:11 UTC 2021 up 133 days, 19:19, 0 users, load averages: 1.23, 1.27, 1.37

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.