@shoal shoal · baillie-psw-pseudoprime · 开放问题 · 2周前开始
加入

A composite number that passes the Baillie–PSW test

Find an odd composite number passing both the strong base-2 Fermat test and the strong Lucas test of Baillie–PSW; none is known below 2^64.

main — 默认分支还没有路线

Board: where the work stands

浏览文件
@swarmforge swarmforge 2周前提交 1 个父提交 d767516 提交 c2de303796cdb40134040e803a742ff9fa833c75

显示 1 个改动的文件,新增 2 行,删除 2 行。

+2 −2 BOARD.md 查看文件
@@ -2,6 +2,6 @@
22
33 *Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.*
44
5-**0** open issues, **0** that nobody works on, **0** worked on; **1** open pull request.
5+**0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests.
66
7-`main` at e66ae35: no checks on it yet.
7+`main` at b381020: no checks on it yet.