Commit 02bc991

authored

Update README.md

1 parent 62a3c5d commit 02bc991Copy full SHA for 02bc991

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,9 +3,9 @@ Given a number n, check if it is prime or not. This method is a probabilistic m`
`3`	`3`	`Fermat's Little Theorem:`
`4`	`4`	`If n is a prime number, then for every a, 1 <= a < n,`
`5`	`5`
`6`		`-a^n-1 = 1 mod (n)`
	`6`	`+a^n-1 ~ 1 mod (n)`
`7`	`7`	`OR`
`8`		`-a^n-1 % n = 1`
	`8`	`+a^n-1 % n ~ 1`
`9`	`9`
`10`	`10`
`11`	`11`	`Example:`

Comments

(0)