f ( n , k ) = a k − 1 = 1 ∑ n a k − 2 = 1 ∑ a k − 1 … a 1 = 1 ∑ a 2 a 0 = 1 ∑ a 1 a 0 2
Compute the remainder when f ( 5 , 2 0 1 6 ) is divided by 2016.
Bonus : Find a simple closed form for f ( n , k ) .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Interesting solution! (+1), relating the function to Pascal's triangle was certainly a very creative approach. The solution I came up with originally was a very simple one, involving translating the innermost term in terms of binomial coefficients and then repeatedly applying the Hockey Stick Identity
Log in to reply
Hmm... I didn't know how to approach the problem but equation 3 reminded me of Pascal's triangle. How do you do a more direct approach? My method is more of "find a pattern, guess a solution then see that it satisfies the equation".
Can you post your solution? Thanks!
Vrey nice approach!
@Calvin Lin Sir , as @Aditya Dhawan said that he solved using binomial coefficients , I too solved it that way.
But I can't post my solution because it involves lots of LATEX codes which I am not so familiar with.
If I post that as a picture , can you convert that to a LATEX modified solution??Please!!
Log in to reply
Sure. Post the solution :)
Log in to reply
I was facing difficulty uploading images , so I have mailed you the solution.
Problem Loading...
Note Loading...
Set Loading...
We change the notation (for reasons apparent later on) from f ( n , k ) to f ( x , y ) .
Make the following observations:
Observation 1: f ( x , y + 1 ) = a y = 1 ∑ x ⎝ ⎛ a y − 1 ∑ a y … ⎠ ⎞ = a y = 1 ∑ x f ( a y , y ) f ( x , y + 1 ) = i = 1 ∑ x f ( i , y ) ( 1 )
Observation 2: f ( x , 1 ) = a 0 = 1 ∑ x a 0 2 From ( 1 ) , we also know that f ( x , 1 ) = i = 1 ∑ x f ( i , 0 ) ⇒ f ( x , 0 ) = x 2 ( 2 )
From ( 1 ) we also conclude that f ( x , y + 1 ) = f ( x − 1 , y + 1 ) + f ( x , y ) ( 3 )
We also extend the function f ( x , y ) to y = − 1 , − 2 , − 3 . This is not strictly necessary but it allows us to spot a pattern. Next, we construct a table using equations ( 2 ) and ( 3 ) for 1 ≤ x ≤ 3 and − 3 ≤ y ≤ 3 .
1 7 2 7 7 7 1 6 2 0 5 0 1 5 1 4 3 0 1 4 9 1 6 1 3 5 7 1 2 2 2 1 1 0 0
Does this seem familiar? Well, maybe not. What if we rotated it?
1 1 1 0 2 1 0 2 3 1 0 2 5 4 1 0 2 7 9 5 1 0 2 9 1 6 1 4 6 1 ⋯
Compare this to Pascal's Triangle: 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 1 0 1 0 5 1 1 6 1 5 2 0 1 5 6 1 ⋯
The only difference is that there is a 0 instead of a 1 in the third row. We notice that by comparing 0 , 2 , 7 , 1 6 , … and 1 , 4 , 1 0 , 2 0 , … the differences are 1 , 2 , 3 , 4 . In general, the f ( x , y ) diagonal is the corresponding Pascal diagonal − the second diagonal away from it.
The Pascal equivalent of columns and rows can be found in terms of n = x + y + 2 , r = y + 3 .
Hence f ( x , y ) = ( r n ) − ( r n − 2 ) f ( x , y ) = ( y + 3 x + y + 2 ) − ( y + 3 x + y )
f ( 5 , 2 0 1 6 ) = 2 4 2 0 2 0 × 2 0 2 1 × 2 0 2 2 × 2 0 2 3 − 2 2 0 2 0 × 2 0 2 1 m o d 2 0 1 6 = 1 9 3