mawerty / Is-Prime

O(1) Algorithm to check if number is prime that works in 95%+ cases.

https://mawerty.github.io/Is-Prime/

mawerty/Is-Prime Issues

lol really thought there was some breakthrough
Updated 2 months ago1
Does this even work?
Updated 3 months ago2
implementation in javascript and typescript should use camelCase
Updated 9 months ago1
BUG: Python implementation doesn't have 95% guarantee
Closed 10 months ago1
I need O(-1), please.
Updated 10 months ago3
You have a rival
Updated 10 months ago3
No INTERCAL implementation?
Closed 10 months ago1
need web4 implementation
Updated 10 months ago2
very slow as a generator
Updated 10 months ago2
Missing unit tests
Updated 10 months ago2
Spanish implementation not working propperly
Closed 10 months ago1
No X++ support?!
Closed 10 months ago1
Could have different versions of markdown one
Closed 10 months ago
SQL ?????
Closed 2 years ago5
Is there something that I should do?
Updated 2 years ago8
Create a website to show it running
Closed 2 years ago
My implementation proves the Riemann Hypothesis; where to collect my prize?
Closed 2 years ago
thoughts on a multithreaded version
Updated 2 years ago3
Hi, unfortunately this algorithm is having some exception cases
Updated 2 years ago6
Add contribution guidelines
Closed 2 years ago9
Optimised main.txt is 1 byte larger than normal one
Closed 2 years ago1
constexpr
Closed 2 years ago1
"optimised" go version clearly not optimal
Closed 2 years ago1
Rust "optimised" needs optimisation
Closed 2 years ago
Missing brainfuck implementation
Closed 2 years ago4
Missing Elixir implementation
Closed 2 years ago1
Missing TypeScript implementation
Closed 2 years ago1