Euler's theorem (anglický)
Hľadať " Euler's theorem " pomocou NRICH | PLUS | maths.org | Google
Definícia vek 18 úroveň 3
If n is a natural number, and a is an integer which is coprime to n, then a φ( n ) −1 is divisible by n, where φ( n ) is Euler's phi function, giving the number of integers less than n and coprime to n.
Prepojenia
- širší:
- (en) Theorem
- užší:
- (en) Fermat's little theorem
- odkazy na iné termíny:
- (en) Coprime
- (en) Euler's phi function
- (en) Modulo remainder
Finančná podpora: