Skip to content

Fermat's little theorem #847

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
poyea merged 6 commits into from
May 28, 2019
Merged

Fermat's little theorem #847

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
36ecbc7
Fix typo
Erfaniaa May 14, 2019
0bc69d4
Merge branch 'master' of github.com:TheAlgorithms/Python
Erfaniaa May 27, 2019
0520bce
Add fermat's little theorem
Erfaniaa May 27, 2019
e9da6d5
Update fermat_little_theorem.py
poyea May 27, 2019
4e10b6a
Fix comments
Erfaniaa May 27, 2019
9f70250
Add Wikipedia reference
Erfaniaa May 27, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Fix comments
  • Loading branch information
@Erfaniaa
Erfaniaa committed May 27, 2019
commit 4e10b6a79aff888f0369b393452c55e656746dd3
3 changes: 1 addition & 2 deletions maths/fermat_little_theorem.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,4 @@
# Python program to show the usage of Fermat's little theorem in a division
# Time complexity: O(log p)
# According to Fermat's little theorem, (a / b) mod p always equals a * (b ^ (p - 2)) mod p
# Here we assume that p is a prime number, b divides a, and p doesn't divide b

Expand All @@ -23,7 +22,7 @@ def binary_exponentiation(a, n, mod):
a = 1000000000
b = 10

# using binary exponentiation function:
# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)

# using Python operators:
Expand Down