Maximize the year!

Find the minimum possible positive integer r r such that ( 2015 r ) \dbinom{2015}{r} is maximum.

Note that ( a b ) \dbinom{a}{b} denote the binomial coefficient.


The answer is 1007.

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.

4 solutions

Peter Macgregor
Apr 25, 2015

If you find the binomial coefficients ( n r ) \dbinom{n}{r} by using Pascal's triangle you find that for each n n and r r ranging from 1 to n n , the row is symmetrical, rising steadily to a maximum and then steadily decreasing.

So the maximum value of ( 2015 r ) \dbinom{2015}{r} occurs in the middle of the 201 5 t h 2015^{th} row of the triangle, in other words when r = 1007 or r = 1008 r=1007\text{ or }r=1008

So the minimum value of r r is 1007 \boxed{1007}

Curtis Clement
Apr 25, 2015

What we have to show is that ( 2 n + 1 n ) > ( 2 n + 1 n a ) a N \dbinom{2n+1}{n} > \dbinom{2n+1}{n-a} \forall a \in N Now by comparing terms in the following two products we see that: ( n a + 1 ) ( n a + 2 ) n < ( n + 2 ) ( n + 3 ) ( n + a ) ( n + a + 1 ) (n-a+1)(n-a+2) \cdots n < (n+2)(n+3) \cdots (n+a)(n+a+1) n ! ( n + 1 ) ! < ( n a ) ! ( n + a + 1 ) ! \implies n!(n+1)! < (n-a)!(n+a+1)! ( 2 n + 1 ) ! ( n a ) ! ( n + 1 + a ) ! < ( 2 n + 1 ) ! n ! ( n + 1 ) ! \Rightarrow\frac{(2n+1)!}{(n-a)!(n+1+a)!} < \frac{(2n+1)!}{n! (n+1)!} ( 2 n + 1 n ) > ( 2 n + 1 n a ) a N \therefore\dbinom{2n+1}{n} > \dbinom{2n+1}{n-a} \forall a \in N

You can prove a stronger version that would work for all kinds of binomial coefficients.

We use the principle of ratio test used in testing convergence of series which is the trivial fact that a sequence is increasing iff T n + 1 T n 1 n Z + \dfrac{T_{n+1}}{T_n}\geq 1~\forall~n\in\Bbb{Z^+} .

Consider r r as the minimum value such that ( n r ) \dbinom{n}{r} gets maximized, where n Z 0 + n\in\Bbb{Z_0^+} . So, we must have,

( n r 1 ) ( n r ) ( n r + 1 ) n 1 2 r n + 1 2 r = { n 1 2 , when n is odd n + 1 2 = n 1 2 , when n is even \binom{n}{r-1}\leq \binom{n}{r}\geq \binom{n}{r+1}\implies \frac{n-1}{2}\leq r\leq \frac{n+1}{2}\\~\\ \implies r=\begin{cases}\dfrac{n-1}{2}~,~\textrm{when }n\textrm{ is odd}\\ \left\lfloor\dfrac{n+1}{2}\right\rfloor=\left\lceil\dfrac{n-1}{2}\right\rceil~,~\textrm{when }n\textrm{ is even}\end{cases}

Prasun Biswas - 6 years, 1 month ago

Log in to reply

I'm really impressed by the increasing number of elegant proofs posted by you across this site. Keep up the good work, m8

Krishna Ar - 6 years, 1 month ago

Log in to reply

Thanks, mate! :3

Prasun Biswas - 6 years, 1 month ago
Chockalingam S
Apr 30, 2015

(n,r) = n! / (n! * (n-r)! ) denominator should be minimum for the expression value to be maximum

n! * (n-r)! would be minimum when r = n/2 when n is even when n is odd, the minimum is attained when r = (n-1)/2 or when r = (n+1)/2

hence for our case, the minimum value of the two is (2015-1)/2 = 1007

You may use Pascal's Triangle.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...