Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Related questions, what are the open problems with prime numbers? Not that I'd ever solve them, but I was having fun using machine learning algorithms try to predict the next prime number in a sequence and it was kind of interesting.


- Goldbach's conjecture (http://en.wikipedia.org/wiki/Goldbach%27s_conjecture)

- Goldbach's weak conjecture (http://en.wikipedia.org/wiki/Goldbach%27s_weak_conjecture) - Harald Helfgott claims that he proved it

- Is factoring in P? (it is known that prime testing is in P; thus the factoring is in NP ∪ coNP) - if it were true, RSA would be broken immediately (and some expert that I talked to told me, he believes that such a factoring algorithm could probably be extended to break ECC, too)

- Riemann hypothesis (http://en.wikipedia.org/wiki/Riemann_hypothesis)

- Do for each even number n exist two prime numbers p > q such that n = p-q?




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

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

Search: