-
Notifications
You must be signed in to change notification settings - Fork 144
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
Hi, unfortunately this algorithm is having some exception cases #37
Comments
Do you have source(s) starting definitively that these numbers are prime? I don't want to dive down a rabbit hole based on a random issue. |
Your test cases are very specific. There are other numbers you know. Try adding them to the test case and see the accuracy go up.. that's all that matters. |
Works on my machine. Have you tried downloading more RAM? |
Realistically a failed test case means you already know it is a prime number. This code is accurate for ~95% from a certain variety of data. Theoretically this is similar to lim(x->∞) f(x) for ~100% accuracy. The more variety of data included, the more accurate the result is for the broad set. |
Unfortunately, I cannot reproduce this issue on my 🚀 RTX 4090 Ti 🚀 bought by my ✨ AMERICAN EXPRESS PLATINUM CARD ✨ for some reason. Have you tried this on the 🚀 RTX 4090 Ti 🚀? If that still doesn't work, try with one bought by the ✨ AMERICAN EXPRESS PLATINUM CARD ✨. Thank you. Let's be real for a second. We all don't have the RTX 4090 Ti, nor the American Express Platinum card. |
@Wwinter-Ttree might be of the poor variety in which case I might be able to represent. I tried to reproduce this in my athlon processor and it didn't show anything. Literally, nothing. I think it finally died. But hey I couldn't reproduce the test either that must mean it doesn't exist. |
I checked 3, 5, 7, and 11. The algorithm is returning false.
I was hoping the authors would be willing to fix this. By maybe adding some if statements
The text was updated successfully, but these errors were encountered: