$$$a_1 = 1$$$
$$$a_2 = 5$$$
$$$a_n = a_{n-1} + n^2(a_{n-2}+1)$$$
Prove $$$a_n=(n+1)!-1$$$
P.S. Original problem
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
$$$a_1 = 1$$$
$$$a_2 = 5$$$
$$$a_n = a_{n-1} + n^2(a_{n-2}+1)$$$
Prove $$$a_n=(n+1)!-1$$$
P.S. Original problem
Название |
---|
Auto comment: topic has been updated by prudent (previous revision, new revision, compare).
Putting $$$n = 1$$$ we get $$$a_1 = (1 + 1)! - 1 = 1$$$.
Putting $$$n = 2$$$ we get $$$a_2 = (2 + 1)! - 1 = 6 - 1 = 5$$$.
Now let the given statement is true for each $$$k < n$$$, let's prove this for $$$k = n$$$. $$$a_n = a_{n - 1} + n^2(a_{n - 2} + 1)$$$, then $$$a_n = n! - 1 + n^2((n - 1)! - 1 + 1) = n! - 1 + n^2 \cdot (n - 1)! = n! - 1 + n \cdot n! = n! \cdot (n + 1) - 1 = (n + 1)! - 1$$$. So, the statement is true for $$$k = n$$$.
By the principle of mathematical induction this is true for each $$$n > 1$$$.
Auto comment: topic has been updated by prudent (previous revision, new revision, compare).