GIMPS - 数学与算法（GIMPS - math and algorithms）.docVIP

下载本文档

8
0
约1.15万字
约 10页
2017-07-20 发布于河南
举报
版权申诉

GIMPS - 数学与算法（GIMPS - math and algorithms）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

GIMPS - 数学与算法（GIMPS - math and algorithms）

GIMPS - 数学与算法（GIMPS - math and algorithms） GIMPS - math and algorithms We found the new mason prime! This page discusses some of the math and computer algorithms used to efficiently search for masons prime. As opposed to mathematicians, I am more of a computer programmer, so I will not go into too much mathematical detail, but instead try to provide links instead. Generate a list (Forming a list) Its easy to prove that if 2P minus 1 is prime, then P must be prime. Therefore, the first step in searching for masons is to generate a list of prime Numbers for testing. Trial Factoring The next step is to eliminate some indices by looking for small factors. There is a very efficient algorithm for determining whether a number is divisible by 2p-1. For example, lets see if 47 can be divisible by 223 minus 1. Convert the exponent 23 to the binary number, and we get 10111. Starting from 1, repeat the following steps: square, delete the index of the left binary, if the bit is 1, will square after value multiplied by 2, and then calculate the remainder after divided by 47. Delete the left if you want to divide by 47 And then you have the remainder of 2 -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- 1 times 1 is 1, 1, 0111, 1 times 2 is 2 2 times 2 is 4, 0, 111, no 4 4 times 4 is 16, 1, 11, 16 times 2 is 32, 32 32 times 32 is 1024. 1, 1024 times 2 is 2048 27 27 times 27 is 729, 1, 729 times 2 is 1458 1 So 223 is equal to 1 mod 47. Subtract 1, 223 minus 1 = 0 mod 47. So we know that 47 is a factor, so 223 minus 1 is not a prime number. Can prove that mason has a very good properties: any factor q 2 p - 1 must be 2 KP + 1 form, and the remainder of a q divided by eight must be 1 or 7. Finally, an efficient program can take advantage of any possible factor q that