Inscribed square problem

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Inscribed square problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Claudio Rocchini, CC BY-SA 3.0, via Wikimedia Commons.