From 02bc9916f9e377519568c351eb1cb8e6db3a91d5 Mon Sep 17 00:00:00 2001 From: Priyangshu yogi Date: Mon, 1 Jan 2018 20:58:13 +0530 Subject: [PATCH] Update README.md --- .../Math/Primality Test/Fermat Method/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Competitive Coding/Math/Primality Test/Fermat Method/README.md b/Competitive Coding/Math/Primality Test/Fermat Method/README.md index 5d56e6ce4..0eb2a8741 100644 --- a/Competitive Coding/Math/Primality Test/Fermat Method/README.md +++ b/Competitive Coding/Math/Primality Test/Fermat Method/README.md @@ -3,9 +3,9 @@ Given a number n, check if it is prime or not. This method is a probabilistic m Fermat's Little Theorem: If n is a prime number, then for every a, 1 <= a < n, -a^n-1 = 1 mod (n) +a^n-1 ~ 1 mod (n) OR -a^n-1 % n = 1 +a^n-1 % n ~ 1 Example: