+- MKLab (https://mklab.gr)
+-- Forum: [INDEX] (https://mklab.gr/forumdisplay.php?fid=1)
+--- Forum: MATHEMATICS (https://mklab.gr/forumdisplay.php?fid=3)
+---- Forum: ARTICLES (https://mklab.gr/forumdisplay.php?fid=13)
+---- Thread: Andrica's conjecture (/showthread.php?tid=1004)
Andrica's conjecture - mklabgr - 07-09-2026
Andrica's conjecture
Summary
Andrica’s conjecture is an unsolved problem in number theory that explores the relationship between consecutive prime numbers. Proposed by Romanian mathematician Dorin Andrica in 1986, the conjecture states that for every pair of consecutive primes $(p_n)$ and $(p_{n+1})$, the difference between their square roots is always less than 1. In mathematical form, it claims that $(\sqrt{p_{n+1}}-\sqrt{p_n}<1)$ for all positive integers ($n$).
Equivalently, the conjecture suggests that the gap between consecutive primes grows slowly enough that it never exceeds the amount predicted by this square-root relationship. Although it has been verified computationally for very large ranges of prime numbers, no general proof or counterexample has been found.
The importance of Andrica’s conjecture lies in its connection to the broader study of prime gaps, the irregular distribution of prime numbers, and fundamental questions in analytic number theory. Researchers have developed many partial results showing that prime gaps usually behave much more moderately than the conjecture’s upper bound allows, and several stronger assumptions about prime distribution would imply its truth.
However, proving the statement for all primes remains beyond current mathematical methods. As with many prime-related problems, Andrica’s conjecture highlights the deep patterns hidden within the seemingly random sequence of prime numbers and continues to inspire research into one of mathematics’ most enduring mysteries.
ARTICLE