benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let P₁P₂…P₂₄ be a regular 24-sided polygon inscribed in a circle ω with circumference 24. Determine the number of ways to choose sets of eight distinct vertices from these 24 such …

Problem

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

problem

Let P1P2…P24P_1P_2\ldots P_{24} be a regular 2424-sided polygon inscribed in a circle ω\omega with circumference 2424. Determine the number of ways to choose sets of eight distinct vertices from these 2424 such that none of the arcs has length 33 or 88.
Plain-text mathematical notation (without MathML)
Let P₁P₂…P₂₄ be a regular 24-sided polygon inscribed in a circle ω with circumference 24. Determine the number of ways to choose sets of eight distinct vertices from these 24 such that none of the arcs has length 3 or 8.
Original LaTeX notation
Let $P_1P_2\ldots P_{24}$ be a regular $24$-sided polygon inscribed in a circle $\omega$ with circumference $24$. Determine the number of ways to choose sets of eight distinct vertices from these $24$ such that none of the arcs has length $3$ or $8$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. 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. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
cda2867e-334f-5556-a266-24f8ad36526c
task_key
test--cda2867e-334f-5556-a266-24f8ad36526c
task_revision_id
1
config / split
/ test

Official source

initial import