| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hello,
I was reading about Egyptian fractions and I could not understand the reason behind taking the ceiling of D/N (the original fraction is N/D) as the largest unit fraction using the Sylvester's sequence. Can someone explain in easier terms?
Thank You
Not sure what exactly the problem is, but here some thoughts about it.
We have the original fraction
. We can represent it as a fraction with numerator 1: 
. However, the denominator of this fraction is, in most cases, not an integer. We can make it an integer by rounding up. Since the denominator is now bigger, the complete fraction is smaller. It is simply the biggest unit fraction smaller than or equal to 
.
This has not much to do with the Sylvester's sequence. It's just a fact that you can generate Sylvester's sequence using a modification of the above discussed algorithm.