Help me to prove: C(2*n,n) | lcm(1,2,3,...,2*n) for all natural n
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
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