Timeline for Is there an polynomial time algorithm to find that sum of square-roots is less than an integer?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 4, 2017 at 21:13 | comment | added | gnasher729 | This website cs.smith.edu/~jorourke/TOPP/P33.html has lots of information about a related problem: Whether one sum of square roots is larger or greater than another one. It has results for upper and lower bounds about the smallest differences between sums of square roots. | |
| Dec 4, 2017 at 19:35 | comment | added | David Richerby | @AlexanderWoo It's a significant open problem in what one might call computational number theory. It would be astounding if the Diophantine approximation people hadn't looked at this. | |
| S Dec 4, 2017 at 1:01 | history | suggested | John Kugelman | CC BY-SA 3.0 |
Improve wording
|
| Dec 3, 2017 at 16:30 | comment | added | Alexander Woo | Has an appropriate number theorist looked seriously at this problem? (I would guess that one has.) There is a long-standing line of research in what is called Diophantine approximation, which proves results saying that |x - (p/q)| > f(q) for a specific function f and any non-rational, algebraic number x and any rational number p/q, with stronger results if you know the degree of the polynomial that x is a root of. The continued fraction expansion of the number (which is easy for square roots) usually is important. (NB: I am not a number theorist.) | |
| Dec 3, 2017 at 15:52 | review | Suggested edits | |||
| S Dec 4, 2017 at 1:01 | |||||
| Dec 2, 2017 at 13:23 | history | answered | David Richerby | CC BY-SA 3.0 |