Approximate equality for two sums of roots
From MaRDI portal
Approximation to algebraic numbers (11J68) Distribution modulo one (11J71) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- Bounding the sum of square roots via lattice reduction
- Diophantine equation \(x^3-y^2=k\) and Hall's conjecture
- Diophantine equations \(x^ m-Ay^ n=k\)
- Effective estimates of solutions of some diophantine equations
- How much precision is needed to compare two sums of square roots of integers?
- scientific article; zbMATH DE number 3485662 (Why is no real title available?)
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 2115025 (Why is no real title available?)
- Letter to the editor: Diophantine equation \(x^ 3-y^ 2=k\) and Hall's conjecture
- Minimal gaps and additive energy in real-valued sequences
- Neighboring powers
- On the minimum gap between sums of square roots of small integers
- Search for good examples of Hall’s conjecture
- USSR is in P/poly
Cited in
(3)
This page was built for publication: Approximate equality for two sums of roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564670)
