benchmarks.wiki / Public workspace

Omni-MATH / Find the maximum number of points X_(i) such that for each i, triangle A B X_{i} cong triangle C D X_{i}.

Problem

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

problem

Find the maximum number of points XiX_{i} such that for each ii, $\triangle A B X_{i} \cong \triangle C D X_{i}$.
Plain-text mathematical notation (without MathML)
Find the maximum number of points X_(i) such that for each i, $\triangle A B X_{i} \cong \triangle C D X_{i}$.
Original LaTeX notation
Find the maximum number of points $X_{i}$ such that for each $i$, $\triangle A B X_{i} \cong \triangle C D X_{i}$.

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

Official source

initial import