Explicit Lower Bounds for Rational Approximation to Algebraic Numbers
From MaRDI portal
Recommendations
Cited in
(15)- Binomial coefficients and Lucas sequences
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- Diophantine approximation and the equation (a^2 c x^k - 1)(b^2 c y^k - 1) = (a b c z^k - 1)^2
- Primitive divisors of elliptic divisibility sequences
- The Diophantine equation \((ax^k-1)(by^k-1)=abz^k-1\)
- Rational approximations to \(\root 3\of 2\) and other algebraic numbers revisited
- Lower and upper estimates of the quantity of algebraic numbers
- Starting with gaps between k-free numbers
- Thue Diophantine Equations
- On the Diophantine equation |𝑎𝑥ⁿ-𝑏𝑦ⁿ|=1
- Pure cubic fields with large minimal index
- Constructive root bound for <tt> k </tt>-ary rational input numbers
- Mixed moments of the Riemann zeta function
- Thue's fundamental theorem. II: Further refinements and examples
- The Diophantine equation \((x^{k} - 1)(y^{k} - 1) = (z^{k} - 1)^{t}\)
This page was built for publication: Explicit Lower Bounds for Rational Approximation to Algebraic Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351432)