-
-
Notifications
You must be signed in to change notification settings - Fork 5.8k
Added Miller Rabin Primality Test #1321
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.
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
Open
sundaram123krishnan
wants to merge
9
commits into
TheAlgorithms:master
from
sundaram123krishnan:master
Open
Changes from 7 commits
Commits
Show all changes
9 commits
Select commit
Hold shift + click to select a range
980947c
Added Miller-Rabin primality test
sundaram123krishnan 8a0861d
Modified Miler Rabin Primality test
sundaram123krishnan 0cd6edc
Delete MillerRabinPrimaliyTest.js
sundaram123krishnan 4f38f0b
added npm format
sundaram123krishnan 2303593
Merge branch 'master' of https://github.com/sundaram123krishnan/JavaS...
sundaram123krishnan 8d922c7
modified with proper indentaion and code quality
sundaram123krishnan cdc6283
formatted using standard js
sundaram123krishnan da3540a
deleted tasks.json
sundaram123krishnan a8df076
uninstalled npm format
sundaram123krishnan 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
There are no files selected for viewing
16 changes: 16 additions & 0 deletions
.vscode/tasks.json
This file contains hidden or 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,16 @@ | ||
| { | ||
sundaram123krishnan marked this conversation as resolved.
Outdated
Show resolved
Hide resolved
|
||
| "version": "2.0.0", | ||
| "tasks": [ | ||
| { | ||
| "type": "npm", | ||
| "script": "test", | ||
| "group": { | ||
| "kind": "build", | ||
| "isDefault": true | ||
| }, | ||
| "problemMatcher": [], | ||
| "label": "npm: test", | ||
| "detail": "jest" | ||
| } | ||
| ] | ||
| } | ||
This file contains hidden or 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,69 @@ | ||
| /* | ||
| * Author: Sundaram krishnan (https://github.com/sundaram123krishnan) | ||
| * Miller–Rabin primality test : https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#:~:text=The%20Miller%E2%80%93Rabin%20primality%20test,the%20Solovay%E2%80%93Strassen%20primality%20test. | ||
| * Used to check whether given number is probably prime or not | ||
| * return true if the number is probably a prime | ||
| * else false | ||
| */ | ||
|
|
||
| /** | ||
| * @function MillerRabin | ||
| * @description -> Checking if a number is probably prime or not | ||
| * @param {number} number | ||
| * @returns {boolean} true if the number is prime, otherwise false | ||
| */ | ||
|
|
||
| const power = (base, exponent, modulus) => { | ||
| let result = 1 | ||
| base %= modulus | ||
|
|
||
| while (exponent) { | ||
| if (exponent & 1) { | ||
| result = (result * base) % modulus | ||
| } | ||
| base = (base * base) % modulus | ||
| exponent >>= 1 | ||
| } | ||
| return result | ||
| } | ||
|
|
||
| const checkComposite = (n, a, d, s) => { | ||
| let x = power(a, d, n) | ||
|
|
||
| if (x === 1 || x === n - 1) { | ||
| return false | ||
| } | ||
|
|
||
| for (let r = 1; r < s; r++) { | ||
| x = (x * x) % n | ||
| if (x === n - 1) { | ||
| return false | ||
| } | ||
| } | ||
| return true | ||
| } | ||
|
|
||
| const MillerRabin = (n, iter = 5) => { | ||
| if (n < 4) { | ||
| return n === 2 || n === 3 | ||
| } | ||
|
|
||
| let s = 0 | ||
|
|
||
| let d = n - 1 | ||
|
|
||
| while ((d & 1) === 0) { | ||
| d >>= 1 | ||
| s++ | ||
| } | ||
|
|
||
| for (let i = 0; i < iter; i++) { | ||
| const a = 2 + (Math.floor(Math.random() * (n - 2)) % (n - 4)) | ||
| if (checkComposite(n, a, d, s)) { | ||
| return false | ||
| } | ||
| } | ||
| return true | ||
| } | ||
|
|
||
| export { MillerRabin } |
16 changes: 15 additions & 1 deletion
package-lock.json
Oops, something went wrong.
This file contains hidden or 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
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.