Skip to content

Fermat_little_theorem type annotation #9794

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
merged 6 commits into from
Oct 5, 2023
Merged

Fermat_little_theorem type annotation #9794

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
ad217c6
Replacing the generator with numpy vector operations from lu_decompos…
quant12345 Sep 29, 2023
07dfc06
Revert "Replacing the generator with numpy vector operations from lu_…
quant12345 Sep 29, 2023
d190bbd
Added type annotation.
quant12345 Oct 5, 2023
5adb48b
Update fermat_little_theorem.py
quant12345 Oct 5, 2023
9bcea88
Update fermat_little_theorem.py
quant12345 Oct 5, 2023
c62fa55
Update maths/fermat_little_theorem.py
tianyizheng02 Oct 5, 2023
File filter

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
Added type annotation.
  • Loading branch information
@quant12345
quant12345 committed Oct 5, 2023
commit d190bbd9bf71eac86d179eaaf295f8f14a86fada
4 changes: 3 additions & 1 deletion maths/fermat_little_theorem.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,8 +4,10 @@
# Here we assume that p is a prime number, b divides a, and p doesn't divide b
# Wikipedia reference: https://en.wikipedia.org/wiki/Fermat%27s_little_theorem

from typing import Union

def binary_exponentiation(a, n, mod):

def binary_exponentiation(a: int, n: Union[int, float], mod: int) -> int:
if n == 0:
return 1

Expand Down