mersenneforum.org Search Results
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 64 Search took 0.02 seconds. Search: Posts Made By: Gary
 Forum: FermatSearch 2021-03-15, 02:38 Replies: 35 Views: 10,204 Posted By Gary Attached is an updated version of Mark’s flist... Attached is an updated version of Mark’s flist program with groups of N matching the N = xx1 – xx0 convention now recommended at FermatSearch and ProthSearch: ...
 Forum: FermatSearch 2021-03-02, 04:19 Replies: 335 Sticky: New Fermat factors Views: 60,413 Posted By Gary Congratulations Luigi! And a Happy Birthday... Congratulations Luigi! And a Happy Birthday (best Birthday present ever!) :fusion::fusion::fusion:
 Forum: FermatSearch 2021-02-20, 03:01 Replies: 12 Sticky: gfn results Views: 6,688 Posted By Gary Thanks Jeppe. I sent an email to Chris Caldwell... Thanks Jeppe. I sent an email to Chris Caldwell on Feb 10 with the divisibilities but got no reply. I guess he has more important things to do :smile:
 Forum: FermatSearch 2021-02-10, 13:46 Replies: 12 Sticky: gfn results Views: 6,688 Posted By Gary Proth prime GFN divisibilities Here are a couple of GFN divisibilities for a new large Proth prime reported on PrimesPages. Reporting here because I don't have the ability to post user comments on PrimesPages, likely because I...
 Forum: FermatSearch 2021-01-05, 14:34 Replies: 3 Views: 945 Posted By Gary To elaborate a bit more, any k*2^n+1 with even k... To elaborate a bit more, any k*2^n+1 with even k can always be represented as k'*2^n'+1 with k' odd and n' > n. For example, LaurV's 296*2^13+1 = 37*2^16+1. Most Fermat factor search programs will...
 Forum: FermatSearch 2021-01-05, 04:21 Replies: 35 Views: 10,204 Posted By Gary Thanks Mark! I will take a look at it. Thanks Mark! I will take a look at it.
 Forum: FermatSearch 2021-01-03, 18:14 Replies: 35 Views: 10,204 Posted By Gary Most ProthSearch ranges are like FermatSearch... Most ProthSearch ranges are like FermatSearch ranges: a range of N * a range of K. There is a good summary table at http://www.prothsearch.com/GFNsrch.txt. I would call the search ranges of the two...
 Forum: FermatSearch 2021-01-03, 04:52 Replies: 35 Views: 10,204 Posted By Gary Luigi recently posted a request that search... Luigi recently posted a request that search ranges which could discover GFN factors be of the form n = xxx0 - xxx0: https://www.mersenneforum.org/showpost.php?p=566369&postcount=9 This would...
 Forum: FermatSearch 2021-01-02, 05:49 Replies: 335 Sticky: New Fermat factors Views: 60,413 Posted By Gary Congratulations Peter!!! You have the highest... Congratulations Peter!!! You have the highest number of "CPU days" (by far) spent searching for Fermat factors. I am glad to see all those CPU (and GPU!) cycles are paying off.
 Forum: FermatSearch 2020-11-07, 18:58 Replies: 32 Views: 2,799 Posted By Gary Phil and I each discovered the F36 factor... Phil and I each discovered the F36 factor independently, and then collaborated on the Math Comp paper. I used a Motorola MC6800 processor based system where the hardware, OS, assembler and Fermat...
 Forum: FermatSearch 2020-11-06, 05:32 Replies: 32 Views: 2,799 Posted By Gary The programs I am familiar with will test each Dk... The programs I am familiar with will test each Dk = k*2^n + 1 for a range of k to see if it divides any Fermat number. To do this, the program will first use a sieve to eliminate all Dk that are...
 Forum: FermatSearch 2020-11-06, 03:57 Replies: 32 Views: 2,799 Posted By Gary Going back to your original question, the answer... Going back to your original question, the answer depends on what you meant by "get the F118 factor": - If you just want to re-discover the factor of F118 for fun, you can do that using any of the...
 Forum: FermatSearch 2020-10-12, 07:23 Replies: 335 Sticky: New Fermat factors Views: 60,413 Posted By Gary Here is a preliminary full list of the xGF(*,a,b)... Here is a preliminary full list of the xGF(*,a,b) divisibilities where a,b <= 12. 7 * 2^18233956 + 1 divides GF(18233952,7) 7 * 2^18233956 + 1 divides xGF(18233953,7,4) 7 * 2^18233956 + 1...
 Forum: FermatSearch 2020-10-11, 03:56 Replies: 335 Sticky: New Fermat factors Views: 60,413 Posted By Gary Wilfrid Keller is aware of the new factor and... Wilfrid Keller is aware of the new factor and just updated his Fermat factors page. I expect he will update the GFN pages once the pfgw run completes. I am running it through pgfw also, as a double...
 Forum: FermatSearch 2020-10-05, 03:17 Replies: 335 Sticky: New Fermat factors Views: 60,413 Posted By Gary Congrats Ryan!!!!!!!!!! That is one HUGE... Congrats Ryan!!!!!!!!!! That is one HUGE factor. :w00t:
 Forum: Lounge 2020-08-19, 02:28 Replies: 76 Poll: GIMPS shirts Views: 21,091 Posted By Gary I received my two T-shirts today. The package... I received my two T-shirts today. The package looks like it has traveled half way around the world (which it has!), but the shirts came through in good condition. And they look awesome! I really like...
 Forum: Software 2020-02-06, 04:06 Replies: 5 Views: 2,771 Posted By Gary Also, from looking at mprime source, I think... Also, from looking at mprime source, I think NoMoreWork=1 has to be in the "global section" of the prime.txt file, before any section headers like [PrimeNet]. When I stuck it at the end of the...
 Forum: Software 2020-02-06, 02:17 Replies: 46 Views: 11,926 Posted By Gary Hi Simon. I agree with Curtis that your flat... Hi Simon. I agree with Curtis that your flat performance vs # cores is likely a symptom of being memory bandwidth limited at that size of FFT. If you can afford it, I would recommend installing 8...
 Forum: Software 2020-02-01, 02:59 Replies: 5 Views: 2,771 Posted By Gary The whatsnew.txt file for 25.5 says " Several... The whatsnew.txt file for 25.5 says " Several files have been renamed so that they are not changed by Windows save/restore. Prime.ini is now prime.txt. ..." So should the NoMoreWork=1 line be...
 Forum: PrimeNet 2020-01-11, 22:27 Replies: 8 Views: 3,820 Posted By Gary Just wondering what the status is on creating a... Just wondering what the status is on creating a benchmark page for all-cores results. It would be helpful to know what the best reported all-cores performance achieved by others is when setting up a...
 2019-12-09, 03:47 Replies: 377 Views: 58,382 Posted By Gary Looks like you are right! When running small... Looks like you are right! When running small ranges, each time before an error occurs the number of factors surviving the sieve is zero (total_bit_count = 0 in the tf_*.h kernel). This causes the...
 2019-11-30, 16:41 Replies: 377 Views: 58,382 Posted By Gary I found it curious that Andreas got errors when... I found it curious that Andreas got errors when trying to verify the factors of F205 and F215, since Serge said he verified these factors when he released version 0.28...
 Forum: FermatSearch 2019-11-04, 07:32 Replies: 223 Sticky: Reservations Views: 54,347 Posted By Gary Finished searching n = 1600-1699, k = 60e9-70e9.... Finished searching n = 1600-1699, k = 60e9-70e9. No factors found.
 Forum: FermatSearch 2019-11-01, 12:44 Replies: 223 Sticky: Reservations Views: 54,347 Posted By Gary I can finish this as part of my search. Thanks... I can finish this as part of my search. Thanks for the heads up on releasing the range.
 Forum: Software 2019-08-12, 02:16 Replies: 543 Views: 65,734 Posted By Gary Yes, agreed. The point I was trying to make... Yes, agreed. The point I was trying to make (maybe poorly) was that even when I use the pmax that maximizes throughput of gfndsieve at n=40, it is still only half the throughput of GMP-Fermat. Once I...
 Showing results 1 to 25 of 64

All times are UTC. The time now is 16:47.

Tue Apr 13 16:47:37 UTC 2021 up 5 days, 11:28, 1 user, load averages: 4.23, 4.29, 4.21

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

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.