Timeline for Diophantine equation: Egyptian fraction representations of 1
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 19, 2015 at 2:41 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
OEIS link updated
|
| May 8, 2012 at 6:55 | answer | added | Marc LeBrun | timeline score: 2 | |
| Jul 2, 2010 at 1:05 | comment | added | Max Alekseyev | Wadim, here is more recent paper on this type of equations: arxiv.org/abs/0712.3954 | |
| Jun 12, 2010 at 16:18 | vote | accept | Eric Rowell | ||
| Jun 12, 2010 at 11:23 | comment | added | Wadim Zudilin | Quite non-standard in diophantine business to count such an enormous amount of solutions: one usually have very few... :-) There is a related diophantine equation, the so-called unit fraction equation, $$ \sum_{i=1}^k\frac1{x_i}+\prod_{i=1}^k\frac1{x_i}=1, $$ for which some work was done (but it's far from being complete), see [W. Butske et al, Comput. Math. 69 (1999), no. 229, 407--420]. | |
| Jun 12, 2010 at 10:29 | answer | added | Hugo van der Sanden | timeline score: 12 | |
| Jun 12, 2010 at 8:42 | comment | added | Dror Speiser | It would be interesting if the solutions can be counted without computing them. If $\pi(x)$ can be computed, maybe so can this. | |
| Jun 12, 2010 at 7:14 | answer | added | David Eppstein | timeline score: 6 | |
| Jun 12, 2010 at 3:11 | history | asked | Eric Rowell | CC BY-SA 2.5 |