Primitive Root Function w/ Euler's Totient

My own developed code to find the primitive roots of a number

Versión 1.3.0.0 (1,52 KB)
282 Descargas
(1)
24 feb 2016

Ahora está siguiendo esta publicación

Calculates every primitive root of a number (if it has any).
Details are best explained by email or skype.

Citar como

Tony (2026). Primitive Root Function w/ Euler's Totient (https://es.mathworks.com/matlabcentral/fileexchange/52691-primitive-root-function-w-euler-s-totient), MATLAB Central File Exchange. Recuperado .

Categorías

Más información sobre Number Theory en Help Center y MATLAB Answers.

Información general

Compatibilidad con la versión de MATLAB

  • Compatible con cualquier versión

Compatibilidad con las plataformas

  • Windows
  • macOS
  • Linux
Abrir en una nueva pestaña
Versión Publicado Notas de la versión
1.3.0.0

Improved the speed significantly (4 times faster). Now running the modulated multiplication in one go rather than resetting each time and checking each step of the way.
Improved the speed significantly (4 times faster). Now running the modulated multiplication in one go rather than resetting each time and checking each step of the way.
1.2.0.0

Using Number theory, I have doubled the speed of this program, should run twice as fast for large primes such as 9001. Email me if interested in the research.
1.1.0.0

Updated how we calculate our very large exponents by finding a way to modulate each multiplication. With no more round off error, this program should run correctly.
1.0.0.0

Edited green text at the beginning of PR function for readability
Edited the Green text at the beginning of the PR function for readability.