Massive Binomial Product

Number Theory Level pending

Find the smallest positive integer n n for which the number A n = k = 1 n ( k 2 k ) = ( 1 1 ) ( 4 2 ) ( n 2 n ) A_n = \prod_{k=1}^n \binom{k^2}{k} = \binom{1}{1} \binom{4}{2} \cdots \binom{n^2}{n} ends in the digit 0 0 when written in base ten.


The answer is 4.

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.

1 solution

Sharky Kesa
Aug 20, 2017

Note that ( 4 2 ) \dbinom{4}{2} has a factor of 2 2 and ( 16 4 ) \dbinom{16}{4} has a factor of 5 5 . Thus, A 4 A_4 satisfies being divisible by 2 2 and 5 5 , so A 4 A_4 is divisible by 10, so it ends in 0. Thus, n = 4 n=4 is the smallest number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...