We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b2c6d60 commit 72b9c9fCopy full SHA for 72b9c9f
number theory/number theory notes.txt
@@ -67,6 +67,13 @@ ie a^(p-1)mod p = 1 ; if a is not divisible by p
67
(a*b)mod m , then b is MMI
68
MMI can be calculated as a^(m-2) mod m and this can be calculated by EXPONENTIATATION given m is prime.
69
-----------------------------------------------------------------------------------------------------------
70
+FERMET- EULER THEORM
71
+if x and n are coprime then ,
72
+ x^ϕ(n) ≡ 1 mod n ;
73
+
74
+ minor version of fermet little THEORM
75
+-----------------------------------------------------------------------------------------------------------
76
77
a^(p-1)mod p = 1 ; if a is not divisible by p
78
79
so for any a^x
0 commit comments