Timeline for Baby $abc$ conjecture for $n$-th roots
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2022 at 1:07 | comment | added | Joe Shipman | The first page of Baker’s paper “Rational Approximations to Certain Algebraic Numbers” promises a constructive bound on the closeness of rational approximations of $nth$ roots of rationals, but the rest of the paper is behind a paywall and I can’t find even a non-paywalled STATEMENT of the theorem elsewhere! Can anyone give me a link to a statement of Baker’s result, or just state it here? | |
| Jan 27, 2022 at 17:49 | comment | added | joro | I believe this approach is known for searching for high quality triples. | |
| Jan 27, 2022 at 16:16 | comment | added | Terry Tao | Applying Liouville's theorem on diophantine approximation to the algebraic number $(t/u)^{1/n}$ would get some preliminary bound. Improving this bound seems related to the problem of trying to find effective versions of the Thue-Siegel-Roth theorem. In this regard, the answers here may be relevant: mathoverflow.net/questions/58856/… | |
| Jan 27, 2022 at 7:59 | history | edited | Daniele Tampieri | CC BY-SA 4.0 |
Math Jaxed + minor improvements
|
| Jan 27, 2022 at 7:07 | history | edited | GH from MO |
edited tags
|
|
| Jan 27, 2022 at 7:06 | comment | added | GH from MO | Please use TeX on this site, and also use a high-level tag like "nt.number-theory". I added this tag now. | |
| S Jan 27, 2022 at 4:33 | review | First questions | |||
| Jan 27, 2022 at 7:05 | |||||
| S Jan 27, 2022 at 4:33 | history | asked | Joe Shipman | CC BY-SA 4.0 |