benchmarks.wiki / Public workspace

AMC (AIMO validation set) / https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_10 / How many ways are there to split the integers 1 through 14 into 7 pairs such that in each pair, the greater number is at least 2 times the lesser number?

Problem

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

problem

How many ways are there to split the integers 11 through 1414 into 77 pairs such that in each pair, the greater number is at least 22 times the lesser number?
Plain-text mathematical notation (without MathML)
How many ways are there to split the integers 1 through 14 into 7 pairs such that in each pair, the greater number is at least 2 times the lesser number?
Original LaTeX notation
How many ways are there to split the integers $1$ through $14$ into $7$ pairs such that in each pair, the greater number is at least $2$ times the lesser number?

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