CombinatoricsDifficulty 5.0AIME, harderProve itUnited States
Problem:
2006 vertices of a regular 2007-gon are red. The remaining vertex is green. Let G be the total number of polygons whose one vertex is green and the others are red. Denote by R the number of polygons whose all vertices are red. Which number is bigger, R or G? Explain your answer.
Solution
Solution:
We will prove that G≥R. For each polygon P with all red vertices we can correspond a polygon with one green vertex (namely we can add the green vertex to the set of vertices of P). Thus G≥R. However, G>R since the triangles with one green vertex can't be corresponded to some polygon whose all vertices are red.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.