OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Resolve errors in math/mod_inverse_by_fermat_theorem.cpp

Browse Source
This commit is contained in:
Mann Mehta 2020-05-09 17:31:48 +05:30
parent 78eecf75eb
commit 563e29acae
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
math/mod_inverse_by_fermat_theorem.cpp
View File

@ -53,7 +53,7 @@ bool isPrime(int64_t m) {
if (m <= 1) {
return false;
} else {
for(int i=2; i*i <= m; i++) {
for (int i=2; i*i <= m; i++) {
if (m%i == 0) {
return false;
}
@ -65,13 +65,15 @@ bool isPrime(int64_t m) {
int main() {
int64_t a, m;
// Take input of a and m.
std::cout << "Computing ((a^(-1))%(m)) using Fermat's Little Theorem" << std::endl;
std::cout << "Give input 'a' and 'm' space separated (m must be a prime number) : ";
std::cout << "Computing ((a^(-1))%(m)) using Fermat's Little Theorem";
std:: cout << std::endl << std::endl;
std::cout << "Give input 'a' and 'm' space separated : ";
std::cin >> a >> m;
if (isPrime(m)) {
std::cout << "The modular inverse of a with mod m is (a^(m-2)) : ";
std::cout << binExpo(a, m-2, m) << std::endl;
} else {
std::cout << "m must be a prime number to apply Fermat's Little Theorem." << std::endl;
std::cout << "m must be a prime number to apply Fermat's Little Theorem.";
std::cout << std::endl;
}
}