Help me to prove: C(2*n,n) | lcm(1,2,3,...,2*n) for all natural n
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Help me to prove: C(2*n,n) | lcm(1,2,3,...,2*n) for all natural n
Name |
---|
Sorry I was wrong :(
dude your wrong :| lcm of m numbers isnt their multipication divided by their gcd
o_O
Let p be a prime number, and assume that k is max number such that p^k <= 2n. Let v_p(n) be the max number t, such that p^t | n. We must prove:
v_p(C(2n, n)) <= v_p(lcm(1, 2, ... , 2*n))
It's easy to see that v_p(lcm(1, 2, ..., 2*n)) = k, and (http://en.wikipedia.org/wiki/Legendre%27s_formula):
v_p(C(2n, n)) = ([2n/p]-2*[n/p]) + ([2n/p^2]-2[n/p^2]) + ... + ([2n/p^k]-2[n/p^k])
But we can easly prove that [2x/y] — 2[x/y] <= 1 for any positive integer x,y, and that's all :)
Thanks I got it ;)
That's the man I expected to answer that question :D