Find the number of even numbers among the following 1001 numbers: \(\left( \begin{matrix} 1000 \\ 0 \end{matrix} \right) ,\left( \begin{matrix} 1000 \\ 1 \end{matrix} \right) ,\left( \begin{matrix} 1000 \\ 2 \end{matrix} \right) ,\left( \begin{matrix} 1000 \\ 3 \end{matrix} \right) ,\left( \begin{matrix} 1000 \\ 4 \end{matrix} \right) . . . \left( \begin{matrix} 1000 \\ 1000 \end{matrix} \right) \).
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
It is probably easiest to use a consequence of Lucas's theorem. Since the base 2 expansion of 1000 is 1111101000, those values n between 0 and 1000 inclusive that have a 1 in their base 2 expansion in at least one place where the expansion of 1000 has a 0 will render (m1000) even.
Now it will be easier to count the complement here, i.e., the number of values which have 0's in their binary expansion wherever the binary expansion of 1000 does, and then subtract this from 1001. So after fixing the four 0's in place, we have six other digit positions which can be filled by either a 0 or a 1. Thus there will be 26=64 values m which will render (m1000) odd, and thus there are 1001−64=937 numbers in the given list that are even.
Log in to reply
Thank you sir for posting such a beautiful approach! Please let me know if there is any alternative method as many jee aspirants are unaware of Lucas theorem. :)
Log in to reply
You're welcome. :) Yes, I noticed the JEE hashtag and wondered if this was a suitable approach for that exam, but I don't know of any other way of solving this problem without resorting to brute force. I'll be interested to see if anyone else knows of a JEE-friendly method.
Log in to reply
r=0∑n⎝⎜⎜⎛nr⎠⎟⎟⎞(−1)r
Can you help me finding the value of :Log in to reply
(rn)=(n−rn).
First note thatThen if n is odd, we would also have (−1)r=−((−1)n−r), which would mean that all the terms in the sum would cancel pairwise, leaving us with an answer of 0.
It gets more interesting if n is even. I found formula #34 in this link, which is complicated, but with p=1 it would appear to give a general solution of
Sn=(1+(−1)n)n+2(n+1).
So for n odd we have Sn=0, (as found before), and for n even we have Sn=n+22(n+1).
I found another excellent resource here which confirms this result, (and much more).
Great question; I've never encountered this type of sum before. :)
Log in to reply
Log in to reply
question inspired by this last question of yours. I hope you don't mind. :)
I posted aLog in to reply
Log in to reply