backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-01 17:52:40 +08:00
Code Issues Projects Releases Wiki Activity

Fix descriptive comment

Browse Source
This commit is contained in:
John Law
2020-05-08 22:45:38 +02:00
committed by GitHub
parent 9872a08f27
commit 409625656d
1 changed files with 4 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
math/mod_inverse_by_fermat_theorem.cpp
View File

@@ -1,6 +1,7 @@
// C++ Program to find the modular inverse using Fermat's Little Theorem.
// Fermat's Little Theorem state that => ϕ(m) = m-1, where m is prime number.
/*
/*
* C++ Program to find the modular inverse using Fermat's Little Theorem.
* Fermat's Little Theorem state that => ϕ(m) = m-1, where m is prime number.
*
* (a * x) ≡ 1 mod m.
* x ≡ (a^(-1)) mod m.
*
@@ -55,7 +56,3 @@ int main() {
std::cout << "The modular inverse of a with mod m is (a^(m-2)) : ";
std::cout << binExpo(a, m-2) << std::endl;
}