[Combinatorics] Possible permutations.
How many ways can 1,4, and 6 be used to add up to 50? Order matters, all integers must be positive. Any ideas as to how i can go about solving this problem are appreciated.
Posted Apr 4, 2017, 1:58 AM UTC · edited
11
f(n) = f(n-1) + f(n-4) + f(n-6) is the recursive relationship
f(1) = 1 (1)
f(2) = 1 (1+1)
f(3) = 1 (1+1+1)
f(4) = 2 (1+1+1+1, 4)
f(5) = 3 (1+1+1+1+1, 1+4, 4+1)
f(6) = 5 (1+1+1+1+1+1, 1+1+4, 1+4+1, 4+1+1, 6)