Hello Codeforces!
Please help me on this mathematical problem:
Given x and k, (x, k are Natural numbers) Find formula of xk - (x - 1)k, corectly open the brackets.
Hello Codeforces!
Please help me on this mathematical problem:
Given x and k, (x, k are Natural numbers) Find formula of xk - (x - 1)k, corectly open the brackets.
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | SecondThread | 150 |
| 8 | -is-this-fft- | 148 |
| 9 | pajenegod | 145 |
| 10 | BledDest | 144 |
What do you mean by formula? Isn't xk - (x - 1)k already a formula?
open the brackets.
Use the binomial theorem:
The first term xk will cancle.
I don't see how is it related to competitive programming at all. You could use Newton's formula to open the brackets and get binomial coefficients, but that won't be easier to calculate (in fact, it would be even harder), so I don't see much use for it. Will you please give a problem where this is needed (or you think this is needed)? It's likely it has more elegant solution than one you propose.