When I was thinking about one problem that has to do with Jordan curves the problem which I am going to describe now, arose in my mind.
And here it goes. It is known that for every $n\geq3$ the circle contains regular convex polygon with $n$ sides, or to try to be more precise and to describe my thoughts more clearly, for every $n\geq3$ the circle contains vertices of at least one regular convex polygon with $n$ sides.
The problem which arose in my mind is does the converse of this also holds, to state it directly : If $C$ is a Jordan curve with property that for every $n\geq3$ there is at least one regular convex polygon with $n$ sides which has vertices on $C$, is then $C$ a circle?
I believe that this is solved somewhere and would like that someone either gives me a link to the paper which contains the proof of this statement or that he/she proves it here in the answer, with arguments that are as elementary as possible.
No, this is not true. Without getting into great details of construction, here is the idea:
We will have a chain of circles, of ever decreasing sizes, such that the circles "converge" to the black point. We will cut small arcs in these circles, and we want them to be small enough so that n-th circle has vertices of n+2-gon. Now we use these cuts to connect the circles.
It's quite straightforward to see that this is a Jordan curve (e.g. we can map $(1/4,3/4)$ to the large circle, $(1/8,1/4)$ and $(3/4,7/8)$ to upper and lower parts of second circle etc. and just take care of connections between circles).