Inscribed square problem

The inscribed square problem, also known as the square peg problem or the Toeplitz conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain all four vertices of some square? This is true if the curve is convex or piecewise smooth and in other special cases.

Source: Wikipedia — Inscribed square problem (CC BY-SA 4.0)

Inscribed square problem

The inscribed square problem, also known as the square peg problem or the Toeplitz conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain all four vertices of some square? This is true if the curve is convex or piecewise smooth and in other special cases.

This neuron ends here.

Source: Wikipedia "Inscribed square problem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy