The Remainder when
is Divided by 11 is . Then Find
.
Where represents Binomial Coefficients..
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.
Let Z = ( k = 1 ∑ 5 ( 2 k − 1 2 0 ) ) 6 , then cosider modulo 1 1
Use a few properties of Pascal Triangle, we get
Z ≡ ≡ ≡ ≡ ≡ ( ( 1 2 0 ) + ( 3 2 0 ) + ( 5 2 0 ) + ( 7 2 0 ) + ( 9 2 0 ) ) 6 ( 2 1 ⋅ ( ( 1 2 0 ) + ( 3 2 0 ) + ( 5 2 0 ) + ( 7 2 0 ) + ( 9 2 0 ) + ( 1 1 2 0 ) + ( 1 3 2 0 ) + ( 1 5 2 0 ) + ( 1 7 2 0 ) + ( 1 9 2 0 ) ) ) 6 2 ( 2 0 − 2 ) × 6 , Use Fermat’s Little Theorem 2 8 3
So γ = 3 which yields the desired answer of 1 0