Given that n = 0 ∑ 6 2 ( n 2 0 1 4 ) ( m o d 2 0 1 7 ) can be written in the form a 2 where a is a positive integer, find a .
2 0 1 7 is prime.
This is from the AMC 12B given yesterday.
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.
Here's another way you could evaluate it (at this point it doesn't really matter how you go about it as long as you get the right answer)
Think of 2 ( k + 1 ) ( k + 2 ) as the sum of the first k + 1 integers. Then we have
1 − ( 1 + 2 ) + ( 1 + 2 + 3 ) − ( 1 + 2 + 3 + 4 ) + ⋯ + ( 1 + 2 + 3 + ⋯ + 6 3 )
− 2 − 4 − 6 − 8 − ⋯ − 6 2 + ( 1 + 2 + 3 + ⋯ + 6 3 )
1 + 3 + 5 + 7 + ⋯ + 6 3 = 3 2 2
Log in to reply
Hey man, great problem! I had a bunch of fun solving it, but I think it would be better to post the source in the solution, because anybody can look up the answer to the AMC 12B 2014. So... maybe change that? Thanks!
Oh God!
Josh - I didnt quite understand your first step in the proof. If you dont mind could you please elaborate on it? Thank you very much!
Log in to reply
( k 2 0 1 4 ) = k ! 2 0 1 4 × 2 0 1 3 × . . . × ( 2 0 1 5 − k ) . This is the defintion of ( b a ) . But 2 0 1 4 ≡ 2 0 1 4 − 2 0 1 7 ≡ − 3 ( m o d 2 0 1 7 ) and 2 0 1 3 ≡ 2 0 1 3 − 2 0 1 7 ≡ − 4 ( m o d 2 0 1 7 ) And so on. Therefore the numerator of that fraction becomes − 3 × − 4 × − 5 × . . . × − ( k + 2 ) ( m o d 2 0 1 7 ) . Therefore ( k 2 0 1 7 ) ≡ k ! − 3 × − 4 × − 5 × . . . × − ( k + 2 ) ( m o d 2 0 1 7 ) I hope that helps. Please say if you want any further clarification
Problem Loading...
Note Loading...
Set Loading...
Since 2014 is so close to 2017, we may think to write out the formula for the binomial coefficients directly ( m o d 2 0 1 7 ) : ( k 2 0 1 4 ) ≡ k ! ( − 3 ) × ( − 4 ) × . . . × ( − ( k + 2 ) ) ( m o d 2 0 1 7 ) So in fact almost all of the terms will cancel out, leaving us with: ( k 2 0 1 4 ) ≡ 2 ( k + 1 ) ( k + 2 ) ( m o d 2 0 1 7 ) if k is even and ( k 2 0 1 4 ) ≡ − 2 ( k + 1 ) ( k + 2 ) ( m o d 2 0 1 7 ) if k is odd. Therefore n = 0 ∑ 6 2 ( n 2 0 1 4 ) ≡ 1 − 3 + 6 − 1 0 + . . . − 2 6 2 × 6 3 + 2 6 3 × 6 4 ( m o d 2 0 1 7 ) . Considering the consecutive pairs of terms we can evaluate this by noting that it is just an arithmetic series with 31 terms, first term -2 and common difference -2. We must also remember to add on the final term 2 6 3 × 6 4 which is not in a pair. As a side note, again to evaluate all the terms except the final one, there is a beautiful proof without words here: http://www.maa.org/sites/default/files/Plaza2007-236990.pdf
However we evaluate it, we get that n = 0 ∑ 6 2 ( n 2 0 1 4 ) ≡ 1 0 2 4 ( m o d 2 0 1 7 ) so a = 3 2