- #1
Ferzurio
- 3
- 0
What is the maximum order of an element modulo n, where n is a product of two odd, distinct primes?
Let t be the smallest positive integer such that
xt = 1 mod n
I've have been searching around on the web, but I don't really understand this concept.
Some of the keyword I have found to be useful to show/use are
'Fermat's Theorem', 'Eulers Phi Function', 'LCM', 'Chinese Remainder Theorem'.
Let t be the smallest positive integer such that
xt = 1 mod n
I've have been searching around on the web, but I don't really understand this concept.
Some of the keyword I have found to be useful to show/use are
'Fermat's Theorem', 'Eulers Phi Function', 'LCM', 'Chinese Remainder Theorem'.