Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo

Content

6 v bool is prime (int x) return false; 7 8 1 test no.99989: passed test no.99990: passed test no.99991: failed test no.99992: passed test no.99993: passed test no.99994: passed test no.99995: passed test no.99996: passed test no.99997: passed test no.99998: passed test no.99999: passed 95.121 tests passed