benchmarks.wiki / Public workspace

Omni-MATH / Let n≥5 be an integer. Find the largest integer k (as a function of n ) such that there exists a convex n -gon A₁A₂…A_(n) for which exactly k of the quadrilaterals …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let n5n \geq 5 be an integer. Find the largest integer kk (as a function of nn ) such that there exists a convex nn -gon A1A2AnA_{1}A_{2}\dots A_{n} for which exactly kk of the quadrilaterals AiAi+1Ai+2Ai+3A_{i}A_{i+1}A_{i+2}A_{i+3} have an inscribed circle. (Here An+j=AjA_{n+j} = A_{j} .)
Plain-text mathematical notation (without MathML)
Let n≥5 be an integer. Find the largest integer k (as a function of n ) such that there exists a convex n -gon A₁A₂…A_(n) for which exactly k of the quadrilaterals A_(i)A_(i+1)A_(i+2)A_(i+3) have an inscribed circle. (Here A_(n+j)=A_(j) .)
Original LaTeX notation
Let $n \geq 5$ be an integer. Find the largest integer $k$ (as a function of $n$ ) such that there exists a convex $n$ -gon $A_{1}A_{2}\dots A_{n}$ for which exactly $k$ of the quadrilaterals $A_{i}A_{i+1}A_{i+2}A_{i+3}$ have an inscribed circle. (Here $A_{n+j} = A_{j}$ .)

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import