Home > Just Math
Getting 13 (Posted on 20140721) 

Using integers 1,2,3 & 4 only , in how many distinct ways a sum of 13 can be achieved?
Rem: The order matters i.e. 1,4,4; 4,1,4; & 4,4,1 are considered distinct.

Submitted by Ady TZIDON

Rating: 4.0000 (1 votes)


Solution:

(Hide)

Let f(n) = number of ways of achieving total n.
f(0)=1 f(1)=2 and the recursion formula is:
f(n) = f(n4) + f(n3) + f(n2) + f(n1).
f(13) = 2872
See Steve Herman detailed soltion. 
Comments: (
You must be logged in to post comments.)


Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ 
About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
