SUMMARY
The discussion centers on the need for software capable of performing primality checks on large prime numbers, specifically those with 10,000-20,000 digits. Users recommend utilizing libraries such as GMP (GNU Multiple Precision Arithmetic Library) and PARI/GP, which include algorithms like the Miller-Rabin test. However, participants emphasize that users will need to write custom code to implement these checks effectively. The original poster seeks existing code and guidance on how to execute these primality tests using available tools.
PREREQUISITES
- Familiarity with primality testing algorithms, specifically the Miller-Rabin test.
- Basic knowledge of programming to implement and modify code.
- Understanding of GMP (GNU Multiple Precision Arithmetic Library) and PARI/GP libraries.
- Experience with MATLAB, particularly the isprime function.
NEXT STEPS
- Explore the GMP library documentation for primality testing functions.
- Learn how to implement the Miller-Rabin test in a programming language of choice.
- Research the PARI/GP environment for advanced number theory computations.
- Seek out existing code repositories or forums for shared implementations of primality checks.
USEFUL FOR
This discussion is beneficial for mathematicians, software developers, and researchers interested in number theory, particularly those looking to perform primality tests on large integers efficiently.