Timeline for Average distance between numbers of the form $2^{a}3^{b}$
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 25, 2010 at 14:47 | answer | added | Mike Bennett | timeline score: 9 | |
| Jan 25, 2010 at 14:06 | comment | added | sdcvvc | Might Størmer's theorem (en.wikipedia.org/wiki/Størmer's_theorem) help here? | |
| Jan 25, 2010 at 13:17 | answer | added | David E Speyer | timeline score: 4 | |
| Jan 25, 2010 at 11:58 | comment | added | Nurdin Takenov | Is it sonehow related to the Collatz problem? | |
| Jan 25, 2010 at 11:49 | answer | added | Douglas S. Stones | timeline score: 1 | |
| Jan 25, 2010 at 10:17 | comment | added | S. Carnahan♦ | You can approximate how many of these numbers are less than N as the area of the right triangle with base log N/log 2 and height log N/log 3. The average distance should be on the order of N divided by this number. | |
| Jan 25, 2010 at 9:55 | history | asked | Pratik Poddar | CC BY-SA 2.5 |