Abstract: In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erd"os that measures the minimal gap size in the sequence of integers at least one of whose prime factors exceeds . This allows us to compute values of for larger and obtain new values of .
Recommendations
- scientific article; zbMATH DE number 2210138
- scientific article; zbMATH DE number 1181819
- scientific article; zbMATH DE number 3775623
- Solutions to the Pell Equation x2 − Ny2 = 1
- scientific article; zbMATH DE number 827959
- On the largest prime factor of $x^{2}-1$
- The number of bounded solutions of norm-form equations via Pell equations and ambiguous classes of solutions
- scientific article; zbMATH DE number 3908511
- scientific article; zbMATH DE number 786157
- On the $x$-coordinates of Pell equations which are Fibonacci numbers
Cites work
- scientific article; zbMATH DE number 3420878 (Why is no real title available?)
- scientific article; zbMATH DE number 3111233 (Why is no real title available?)
- A Conjecture of Erdos Concerning Consecutive Integers
- Compact representation of quadratic integers and integer points on some elliptic curves
- On a problem of Störmer
- On the largest prime factor of $x^{2}-1$
- Prime Factors of Consecutive Integers
- Prime factors of consecutive integers
- Smooth values of some quadratic polynomials
- The Prime Factors of Consecutive Integers
This page was built for publication: Large strings of consecutive smooth integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651390)