3 ms·
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 pr
by Houshalter 13y ago
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.
- wolfgke 13y ago- Goldbach's conjecture (http://en.wikipedia.org/wiki/Goldbach%27s_conjecture http://en.wikipedia.org/wiki/Goldbach%27s_conjecture) - Goldbach's weak conjecture (http://en.wikipedia.org/wiki/Goldbach%27s_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 http://en.wikipedia.org/wiki/Riemann_hypothesis) - Do for each even number n exist two prime numbers p > q such that n = p-q?