Timeline for Is every integer $\ge 312$ the sum of two integers with triangular divisors?
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2020 at 16:09 | comment | added | Gerhard Paseman | Another elementary observation: k*4^n has triangular divisors where k is less than 4^n (oops, less than 2^(n+1). This means every number m is within about sqrt(m) (again oops, more like m to the two thirds) of such a number, and gives a weak logarithmic bound to the number of terms such a sum. One might be able to tweak this to get better bounds. Gerhard "Solve Sum Bit By Bit" Paseman, 2020.06.09. | |
| Jun 9, 2020 at 16:01 | history | answered | JoshuaZ | CC BY-SA 4.0 |