https://github.com/brainstone/mersenneprime-benchmark

This project aims to find the optimal way of calculating Mersenne Primes and the optimal way to perform the Lucal-Lehmer test (using the built in BigInteger type/class)
https://github.com/brainstone/mersenneprime-benchmark

Last synced: 4 months ago
JSON representation

This project aims to find the optimal way of calculating Mersenne Primes and the optimal way to perform the Lucal-Lehmer test (using the built in BigInteger type/class)

• Host: GitHub
• URL: https://github.com/brainstone/mersenneprime-benchmark
• Owner: BrainStone
• License: mit
• Created: 2020-03-16T23:12:21.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2020-03-18T00:00:34.000Z (over 6 years ago)
• Last Synced: 2024-12-31T08:45:38.366Z (over 1 year ago)
• Language: Java
• Size: 99.6 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Funding: .github/FUNDING.yml
  • License: LICENSE

Awesome Lists containing this project

README

          
# MersennePrime-Benchmark

This project aims to find the optimal way of calculating Mersenne Primes and the optimal way to perform the Lucal-Lehmer test (using the built in BigInteger type/class)