Current location - Training Enrollment Network - Mathematics courses - Mathematical drawer problem
Mathematical drawer problem
Yes, you can use the reduction to absurdity. Assuming that all four colors of hats are less than 12, and each color is at most 1 1, then the total number of hats with four colors should be at most 44 and less than 45. Assuming that the proposition is not established, it can be proved that there is always a hat with one color not less than 12.