benchmarks.wiki / Public workspace

Omni-MATH / Given two integers m,n satisfying 4<m<n. Let A_{1}A_{2}cdots A_{2n plus{} 1} be a regular 2nplus{}1 polygon. Denote by P the set of its vertices. Find the number of convex m poly…

Problem

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

problem

Given two integers m,n m,n satisfying 4<m<n. 4 < m < n. Let $ A_{1}A_{2}\cdots A_{2n \plus{} 1}$ be a regular $ 2n\plus{}1$ polygon. Denote by P P the set of its vertices. Find the number of convex m m polygon whose vertices belongs to P P and exactly has two acute angles.
Plain-text mathematical notation (without MathML)
Given two integers m,n satisfying 4<m<n. Let $ A_{1}A_{2}\cdots A_{2n \plus{} 1}$ be a regular $ 2n\plus{}1$ polygon. Denote by P the set of its vertices. Find the number of convex m polygon whose vertices belongs to P and exactly has two acute angles.
Original LaTeX notation
Given two integers $ m,n$ satisfying $ 4 < m < n.$ Let $ A_{1}A_{2}\cdots A_{2n \plus{} 1}$ be a regular $ 2n\plus{}1$ polygon. Denote by $ P$ the set of its vertices. Find the number of convex $ m$ polygon whose vertices belongs to $ P$ and exactly has two acute angles.

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