- #1
wrong_class
- 18
- 0
Im not sure if this should go in the math/number theory section or here, but here it goes:
how do programs calculate the primitive roots mod n of extremely large primes? My program will only go up to 12-14 bits before having memory errors caused by storage of the totient of the prime number
does anyone have any code that i can integrate into my program? pseudocode? general idea that can be easily translated into code? anything?
THIS IS NOT HOMEWORK. WRITING MATH PROGRAMS IS A HOBBY, NOT AN ASSIGNMENT
how do programs calculate the primitive roots mod n of extremely large primes? My program will only go up to 12-14 bits before having memory errors caused by storage of the totient of the prime number
does anyone have any code that i can integrate into my program? pseudocode? general idea that can be easily translated into code? anything?
THIS IS NOT HOMEWORK. WRITING MATH PROGRAMS IS A HOBBY, NOT AN ASSIGNMENT