Primitive Root Function w/ Euler's Totient

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

Version 1.3.0.0 (1.52 KB)
282 Downloads
(1)
24 Feb 2016

You are now following this Submission

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

Cite As

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

Categories

Find more on Number Theory in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab
Version Published Release Notes
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.