Timeline for Mini-$abc$ conjecture
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2021 at 17:12 | history | edited | Wolfgang |
edited tags
|
|
| S May 5, 2019 at 18:16 | history | suggested | user64494 | CC BY-SA 4.0 |
The title is improved.
|
| May 5, 2019 at 16:57 | review | Suggested edits | |||
| S May 5, 2019 at 18:16 | |||||
| May 5, 2019 at 15:24 | comment | added | Wojowu | It's worth noting that the $2^{sign(m)}3^{sign(n)}$ is immaterial, since its log is obviously $o(\log c)$, so you might as well get rid of it. | |
| May 5, 2019 at 13:27 | comment | added | Yaakov Baruch | @FedorPetrov: sign(0)=0, sign(a)=1 if a>0. | |
| May 5, 2019 at 13:26 | comment | added | Fedor Petrov | what is $\mathrm{sign}(m)$? | |
| May 5, 2019 at 13:13 | comment | added | Wojowu | We are dealing with triples of the form $p+q2^m=r3^n$ or similar, with $p,q,r$ "small", which in particular gives $q2^m\approx r3^n$. Using Baker's theorem it should be possible to give some nontrivial bounds on the quality. | |
| May 5, 2019 at 12:46 | history | asked | Yaakov Baruch | CC BY-SA 4.0 |