Algorithms on Primality Test #251
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Please specify the issue name |
|
Issue #185 , interesting math algo in Competitive programming. |
|
edit the issue name pls |
|
Ok it is done. |
|
@prateekiiest long time no see. |
prateekiiest
requested changes
Dec 28, 2017
| Fermat's Little Theorem: | ||
| If n is a prime number, then for every a, 1 <= a < n, | ||
|
|
||
| a^n-1 ≡ 1 (mod n) |
There was a problem hiding this comment.
add a tilde here like this a^n-1 = 1 mod(n)
| Output: true | ||
|
|
||
| Input: n = 15 | ||
|
|
There was a problem hiding this comment.
make all input / output bold and tilde for n assignment
| (6k + 3). So a more efficient method is to test if n is divisible by 2 or 3, then to check through all the numbers of | ||
| form 6k ± 1. | ||
|
|
||
| Time complexity of this solution is O(√n). |
|
is it all ok now?? |
| 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 |
|
Is it okay?? |
|
Sorry for the so long delay. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
ISSUE NUMBER - #185
SHORT DESCRIPTION
Consist of various methods to find a number is prime or not.
LOCATION
I am including this in a folder named Primality Test in math folder inside Competitive programming.
##INSIDE
All these methods are described in its perspective README.md and the implementation part is in the ScrCode.cpp file.