Timeline for The difference of two sums of unit fractions
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2010 at 16:40 | comment | added | Anadim | Thank you for your answer. I checked the wiki entry, but for my case the unit fractions need not be distinct, that is, not all $a_i$s (or all $b_j$s) are distinct. I wanted to find an asymptotic lower bound with respect to $n$. So basically I tried to find whether the difference can be lower bounded by some 1/poly(n), or not. | |
| Oct 2, 2010 at 9:51 | comment | added | Nurdin Takenov | Well, actually he gave the bound - denominators should be no larger than $n$. | |
| Oct 2, 2010 at 9:38 | history | answered | Charles Matthews | CC BY-SA 2.5 |