On Some Planet,there are Countries ( ).
Each Country Has a Flag units wide and one unit high composed of Fields of size ,each field being either yellow or blue.No two countries have the same flag.
We say that a set of flags is diverse if these flags can be Arranged in square so that all fields on its Main Diagonal will have the same colour.
Determine the Smallest Possible integer such that among any distinct flags,there exist Flags forming a Diverse Set.
I Need A bit of help In Understanding the Last Part of the Problem.
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
@Calvin Lin @Jon Haussmann @Pratik Shastri @Raghav Vaidyanathan @Deepanshu Gupta @Brian Charlesworth @Sandeep Bhardwaj @Pranjal Jain @Ronak Agarwal @Azhaghu Roopesh M
Any Ideas?
The last part of the question is asking the value of the smallest possible value of m such that if you take any m flags from the 2n flags, you can always find n flags from those m flags such that those n flags form a "diverse" set.
m≥n is implicit, otherwise we wouldn't be able to take n flags from the m flags.
Is this question from a Maths Magazine for JEE? (Can't remember the name).
Yes,Its from that Magazine,"Mathematics Today"..
Thanks,I got the meaning now,Perphaps now everyone can solve it.
They should also clarify if "main diagonal" refers to just 1 diagonal, or both. As it turns out, it's just 1 diagonal, ie. squares of the form (i,i).
This is IMO Shortlist 2010 C2, which I believe is the primary source.
This is essentially a construction problem and there are 2 main parts to it.
We have have to guess what M is going to be, and explain why M−1 doesn't work. That's the easy part.
We then have to show that given M flags, we can always find N that satisfy the condition. There is a solution using the "backward induction" approach, but the base case requires quite a bit of work.
There is another solution using the Hall Marriage Theorem, but that would require more understanding.