prime-search

This is a prime-searching project.

How does it work?

It uses the Proth's theroem to check primality.

# Install Anaconda on Linux
pip install tqdm gmpy2
git clone https://github.com/StevenJinyanCheng/prime-search.git
cd prime-search
python proth.py -h

The biggest prime found is 555*2^16609+1 with 5003 digits.

Name		Name	Last commit message	Last commit date
Latest commit History 17 Commits
.vscode		.vscode
__pycache__		__pycache__
README.md		README.md
proth-result.py		proth-result.py
proth.py		proth.py
proth_cpp.cpp		proth_cpp.cpp
proth_cpp.exe		proth_cpp.exe
show-what.py		show-what.py