cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A078933 Good examples of Hall's conjecture: integers x such that 0 < |x^3 - y^2| < sqrt(x) for some integer y.

Original entry on oeis.org

2, 5234, 8158, 93844, 367806, 421351, 720114, 939787, 28187351, 110781386, 154319269, 384242766, 390620082, 3790689201, 65589428378, 952764389446, 12438517260105, 35495694227489, 53197086958290, 5853886516781223, 12813608766102806, 23415546067124892, 38115991067861271
Offset: 1

Views

Author

Keywords

Comments

Hall conjectured that the nonzero difference k = x^3 - y^2 cannot be less than C x^(1/2), for a constant C. His original conjecture, probably false, has been reformulated in the following way: For any exponent e < 1/2, a constant K_e > 0 exists such that |x^3 - y^2| > K_e x^e.
Danilov found an infinite family of solutions to |x^3 - y^2| < sqrt(x). For more detail see A200216. [Artur Jasinski, Nov 04 2011]

Examples

			|5234^3 - 378661^2| = 17 < sqrt(5234), so 5234 is in the sequence.
		

References

  • Noam D. Elkies, Rational points near curves and small nonzero |x^3 - y^2| via lattice reduction. Algorithmic Number Theory. Proceedings of ANTS-IV; W. Bosma, ed.; Springer, 2000; pp. 33-63.
  • Marshall Hall Jr., The Diophantine equation x^3 - y^2 = k, in Computers in Number Theory; A. O. L. Atkin and B. Birch, eds.; Academic Press, 1971; pp. 173-198.

Crossrefs

Programs

  • Mathematica
    For[x=1, True, x++, If[Abs[x^3-Round[Sqrt[x^3]]^2] < Sqrt[x] && !IntegerQ[Sqrt[x]], Print[x]]]