Search found 2 matches
- Tue Aug 03, 2021 12:21 pm
- Forum: National Math Olympiad (BdMO)
- Topic: BdMO 2017 National Round Secondary 7
- Replies: 17
- Views: 20856
Re: BdMO 2017 National Round Secondary 7
We will rather prove this general statement, $n$ is the lowest number of colors needed to color $m$ pictures in such a way that there is a common color in every $n$ pictures. But, there is no common color in all $m$ pictures. Shouldn't we need at least $n+1$ colors? I've gone through your proof, no...
- Sun Aug 01, 2021 5:54 pm
- Forum: National Math Olympiad (BdMO)
- Topic: BdMO 2017 National Round Secondary 7
- Replies: 17
- Views: 20856
Re: BdMO 2017 National Round Secondary 7
We will rather prove this general statement, $n$ is the lowest number of colors needed to color $m$ pictures in such a way that there is a common color in every $n$ pictures. But, there is no common color in all $m$ pictures. The given conditions are, $(i)$ There is a common color in any $n$ picture...