找回密码
 欢迎注册
查看: 18|回复: 1

[欣赏] PRP Records Probable Primes Top 10000

[复制链接]
发表于 昨天 15:15 | 显示全部楼层 |阅读模式

马上注册,结交更多好友,享用更多功能,让你轻松玩转社区。

您需要 登录 才可以下载或查看,没有账号?欢迎注册

×
PRP Records
Probable Primes Top 10000
(300809 PRPs in the top)
What is a PRP ?

A PRP is a probable prime number, a number that nobody knows how to prove or disprove its primality.
Here are some criterions that can be used to recognize these numbers :
- N does not have any prime factor up to 2^32.
- N cannot be trivially written into a product.
- Take 3 square-free consecutive bases such that (b1/N)=(b2/N)=(b3/N)= -1. N should be such that b1^((N-1)/2)=b2^((N-1)/2)=b3^((N-1)/2)= -1 (mod N).
- Take a prime base such that (b/N)= -1 and b<>b1<>b2<>b3. N should pass the strong test in base b.
- or more (if someone has got an idea) !!!


http://www.primenumbers.net/prptop/prptop.php
比如
(10^8177207-1)/9这个大整数有8177207位,很可能是素数!
毋因群疑而阻独见  毋任己意而废人言
毋私小惠而伤大体  毋借公论以快私情
 楼主| 发表于 昨天 15:17 | 显示全部楼层
来自网页
https://t5k.org/primes/download.php

https://t5k.org/primes/lists/all.txt

THE LARGEST KNOWN PRIMES
                     (The 5,000 largest known primes)
        (selected smaller primes which have comments are included)
    Originally Compiled by Samuel Yates -- Continued by Chris Caldwell and now maintained by Reginald McLean
                       (Mon Jan 20 04:38:06 UTC 2025)


So that I can maintain this database of the 5,000 largest known primes
(plus selected smaller primes with 1,000 or more digits), please send
any new primes (that are large enough) to:

  https://t5k.org/bios/submission.php

This list in a searchable form (plus information such as how to find
large primes and how to prove primality) is available at the interactive
web site:

  https://t5k.org/primes/

See the last pages for information about the provers.

The letters after the rank refer to when the prime was submitted.
'a' is this month, 'b' last month...
毋因群疑而阻独见  毋任己意而废人言
毋私小惠而伤大体  毋借公论以快私情
您需要登录后才可以回帖 登录 | 欢迎注册

本版积分规则

小黑屋|手机版|数学研发网 ( 苏ICP备07505100号 )

GMT+8, 2025-1-21 08:52 , Processed in 0.024256 second(s), 16 queries .

Powered by Discuz! X3.5

© 2001-2025 Discuz! Team.

快速回复 返回顶部 返回列表