Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 3f8bd12

Browse files
Update README.md
1 parent 4f8fbf0 commit 3f8bd12

File tree

1 file changed

+1
-1
lines changed
  • Competitive Coding/Math/Primality Test/Fermat Method

1 file changed

+1
-1
lines changed

‎Competitive Coding/Math/Primality Test/Fermat Method/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ Given a number n, check if it is prime or not. This method is a probabilistic m
33
Fermat's Little Theorem:
44
If n is a prime number, then for every a, 1 <= a < n,
55

6-
a^n-1 1 (mod n)
6+
a^n-1 = 1 mod (n)
77
OR
88
a^n-1 % n = 1
99

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /