benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / You are given 16 pieces of paper numbered 16,15,…,2,1 in that order. You want to put them in the order 1,2,…,15,16 switching only two adjacent pieces of paper at a time. What is th…

Problem

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

problem

You are given 16 pieces of paper numbered 16,15,…,2,116,15, \ldots, 2,1 in that order. You want to put them in the order 1,2,…,15,161,2, \ldots, 15,16 switching only two adjacent pieces of paper at a time. What is the minimum number of switches necessary?
Plain-text mathematical notation (without MathML)
You are given 16 pieces of paper numbered 16,15,…,2,1 in that order. You want to put them in the order 1,2,…,15,16 switching only two adjacent pieces of paper at a time. What is the minimum number of switches necessary?
Original LaTeX notation
You are given 16 pieces of paper numbered $16,15, \ldots, 2,1$ in that order. You want to put them in the order $1,2, \ldots, 15,16$ switching only two adjacent pieces of paper at a time. What is the minimum number of switches necessary?

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
3f28dda4-1ffc-546d-a31e-555928487cd2
task_key
test--3f28dda4-1ffc-546d-a31e-555928487cd2
task_revision_id
1
config / split
/ test

Official source

initial import