Redmond-Sun conjecture
From Wikipedia, the free encyclopedia
In mathematics, the Redmond-Sun conjecture (raised by Stephen Redmond and Zhi-Wei Sun in 2006) states that an interval [xm,yn] with
contains primes with only finitely many exceptions. Namely, those exceptional intervals [xm,yn] are as follows:
The conjecture has been verified for intervals [xm,yn] below 1012. It includes Catalan's conjecture and Legendre's conjecture as special cases. Also, it is related to the abc conjecture as suggested by Carl Pomerance.
![[2^3,\,3^2],\ [5^2,\,3^3],\ [2^5,\,6^2],\ [11^2,\,5^3],\ [3^7,\,13^3],](../../../../math/a/b/f/abf68662d93d360c83576d85477b799a.png)
![[5^5,\,56^2],\ [181^2,\,2^{15}],\ [43^3,\,282^2],\ [46^3,\,312^2],\ [22434^2,\,55^5].](../../../../math/6/e/4/6e4fce7e8d21ebaa31f2849ac9c6019c.png)

