Help me to prove: C(2*n,n) | lcm(1,2,3,...,2*n) for all natural n
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
Help me to prove: C(2*n,n) | lcm(1,2,3,...,2*n) for all natural n
Название |
---|
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