is it true that ?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
Just thoughts.
L is left part, R is right part.
L = PL1 + PL2 + ... + PLk
R = PR1 + PR2 + ... + PRk
My theory is for all i = 1..k PLi > PRi.
Induction. Base i = 1.
So for x > 0: PL1 > PR1
And I really don't know what's next (if I'm on the right path).
Yeah, it is true. But proving this is a bit painful. Here is the only way I know:
Reminder: generating function of sequence is formal series .
Consider amount of ways to split number in sum of distinct numbers. Generating function for this sequence is . Now consider number of ways to split number in sum of not necessary distinct odd numbers. Generating function for this sequence is . Let's multiply each functions by . Then first one becomes and the second one become . Thus number of ways to split in distinct numbers equals number of ways to split in in odd numbers (you can also prove it with some combinatorics, I guess).
Now consider which is the number of ways to split in distinct numbers. . Thus if then . Then .
And with odd numbers part we have . Since , we have equation from the statement now.
Understanding of correctness of each transition in proof is left to reader as an excercise ;)