Find all integers $n$ and $m$, $n > m > 2$, and such that a regular $n$-sided polygon can be inscribed in a regular $m$-sided polygon so that all the vertices of the $n$-gon lie on the sides of the $m$-gon.
Problem
Source: Nordic Mathematical Contest 2017 Problem 4
Tags: combinatorics, geometry
04.04.2017 20:53
Are these the only solutions $(m,n)=(3,4);(2k+1,4k+2);(2k,4k)$ and $(2k,3k)$?
04.04.2017 21:37
(redacted)
06.04.2017 18:44
any solution?
06.04.2017 20:15
06.04.2017 20:40
. By symmetry, the two points on each side of the $m$-gon have equal distance from the midpoint of that side. Why did you get this?
07.04.2017 03:32
galav wrote: . By symmetry, the two points on each side of the $m$-gon have equal distance from the midpoint of that side. Why did you get this? Take a look at the sides adjacent to that side, and it will be clear.
07.04.2017 05:44
In the diametrically opposite case . The two gons have the same center , because parallel sides of regular gon are the diametrically opposite. So we don't need to argue. Am I right?
07.04.2017 07:40
galav wrote: In the diametrically opposite case . The two gons have the same center , because parallel sides of regular gon are the diametrically opposite. So we don't need to argue. Am I right? Well, you still need to show that even if they share the same center, you can't have them somehow work out and be inscribed, which my argument shows without fuss.