Timeline for Algorithm for least distance of powers of integers
Current License: CC BY-SA 2.5
20 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2011 at 7:01 | vote | accept | Asterios Gkantzounis | ||
| Feb 5, 2011 at 21:50 | |||||
| Feb 2, 2011 at 22:38 | comment | added | David Roberts♦ | Corrected spelling in title. It was irking me... | |
| Feb 2, 2011 at 22:38 | history | edited | David Roberts♦ | CC BY-SA 2.5 |
Corrected spelling in title
|
| Jan 29, 2011 at 9:19 | vote | accept | Asterios Gkantzounis | ||
| Jan 30, 2011 at 8:12 | |||||
| S Jan 29, 2011 at 9:19 | vote | accept | Asterios Gkantzounis | ||
| Jan 29, 2011 at 9:19 | |||||
| Jan 26, 2011 at 23:04 | vote | accept | Asterios Gkantzounis | ||
| S Jan 29, 2011 at 9:19 | |||||
| Jan 25, 2011 at 7:57 | vote | accept | Asterios Gkantzounis | ||
| Jan 25, 2011 at 11:49 | |||||
| Jan 24, 2011 at 6:42 | vote | accept | Asterios Gkantzounis | ||
| Jan 24, 2011 at 16:38 | |||||
| Jan 24, 2011 at 6:39 | vote | accept | Asterios Gkantzounis | ||
| Jan 24, 2011 at 6:40 | |||||
| Jan 24, 2011 at 6:28 | vote | accept | Asterios Gkantzounis | ||
| Jan 24, 2011 at 6:28 | |||||
| Jan 23, 2011 at 10:39 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
deleted 10 characters in body
|
| Jan 23, 2011 at 8:20 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
added 11 characters in body
|
| Jan 22, 2011 at 22:22 | answer | added | Aaron Meyerowitz | timeline score: 5 | |
| Jan 22, 2011 at 21:01 | answer | added | JSE | timeline score: 5 | |
| Jan 22, 2011 at 19:27 | comment | added | Mark Bennet | @carl - correct, continued fractions. | |
| Jan 22, 2011 at 19:17 | comment | added | Carl Feynman | I think what the previous commenter meant was the best rational approximation to $ln(a)/ln(b)$. (See en.wikipedia.org/wiki/…) | |
| Jan 22, 2011 at 17:26 | history | edited | Asterios Gkantzounis |
edited tags
|
|
| Jan 22, 2011 at 17:09 | comment | added | Mark Bennet | So we have $a^{m} = c + b^{n}$ or approximately $m\ln(a) = n\ln(b)$ (with c small) and convert $ln(b)/ln(a)$ to partial fractions to get some potentially good values of m and n. | |
| Jan 22, 2011 at 15:39 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
added 13 characters in body
|
| Jan 22, 2011 at 15:28 | history | asked | Asterios Gkantzounis | CC BY-SA 2.5 |