The pedal-polygon equivalence conjecture for n-gons

Let G(n)G(n) be the set of nn-gons, and let \perp denote the equivalence relation generated by the pedal-polygon construction.

Pedal-polygon equivalence conjecture. For integer n5n\ge 5, if G(n)G(n) is the set of nn-gons, then

G(n)/=1.|G(n)/{\perp}|=1.

The preceding theorem establishes the analogous statement for quadrilaterals, while the assertion for all integers n5n\ge 5 is presented as a conjecture and its resolution is not supplied here.

Sources & referencesView supporting material

Primary source

Chia-An Hsu, Hsin-Chuang Chou, Chen-Rui Liu, Chih-Hsuan Liang and Yu-Wei Chang, “Topics on Pedal Polygons”, arXiv:2108.08293 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.