Need software for running primality checks.

  • Thread starter Thread starter mesa
  • Start date Start date
  • Tags Tags
    Running Software
Click For Summary
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.

mesa
Gold Member
Messages
694
Reaction score
36
I love pen and paper but am terrible with computing. I have a copy of MatLab on my computer and aside from the operating system and Word that's about it. I need software that can run primality checks on 'small' gigantic primes of 10,000-20,000 digits in length.

Where do I need to start?
 
Technology news on Phys.org
You probably mean that you want something already written that can do a primality check on large numbers.

A lot of software like gmp and pari have code, like the Miller-Rabin test, to do this, but you have to write pieces of your own code to actually do the check itself. There are posters here who have undoubtedly already done this.

I do not have anything like that myself.

So what I perceive that you want is to get a copy of someone's code with instructions on how to build and run it.
I'm pointing this out so that maybe someone will come forward for you.
 
jim mcnamara said:
You probably mean that you want something already written that can do a primality check on large numbers.

A lot of software like gmp and pari have code, like the Miller-Rabin test, to do this, but you have to write pieces of your own code to actually do the check itself. There are posters here who have undoubtedly already done this.

I do not have anything like that myself.

So what I perceive that you want is to get a copy of someone's code with instructions on how to build and run it.
I'm pointing this out so that maybe someone will come forward for you.

Your post is correct although I do have some help on this end. I really need to learn more about these things but need a starting point and the isprime feature on MatLab is not quite cutting it.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
Replies
29
Views
6K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 14 ·
Replies
14
Views
7K
  • · Replies 12 ·
Replies
12
Views
3K