Hacker News new | past | comments | ask | show | jobs | submit login

Amateur question, but is it possible that the weak numbers are ones that pass some primality test which can give false-positives? Like Miller–Rabin I believe is only a probabilistic test - if it was run with not enough iterations, there would be some specific numbers which need more than N iterations (where N is an arbitrary threshold in some software). Would those number be in the "weak" subset found in the paper?



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: