How do I find the number of solutions in the equation $$a_1 + a_2 + a_3 +\dots+a_k=2021$$ in terms of $k$ with $1\leq a_1, a_2, \dots, a_k\leq9$? I know the first step is to introduce a new variable, say $b_i + 1 = a_i$ for $i=1,2,\dots,k$ so that it turns into $$b_1+b_2+b_3+\dots b_k=2021-k$$ with $0\leq b_1, b_2,\dots, b_k\leq8$, but how do I continue?
Asked
Active
Viewed 57 times
0
-
To complete the problem, just follow the model in this answer. I am voting to close, as a duplicate. – user2661923 Mar 31 '23 at 01:59
-
With respect to the linked answer, in particular, notice the Addendum (shortcuts), which discuss capitalizing on the fact that each variable has the same upper bound. – user2661923 Mar 31 '23 at 02:02
-
To the best of my knowledge, the only other approach is generating functions, which I am ignorant of. – user2661923 Mar 31 '23 at 02:04