benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Yang has the sequence of integers 1,2,…,2017. He makes 2016 swaps in order, where a swap changes the positions of two integers in the sequence. His goal is to end with 2,3,…,2017,1…

Problem

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

problem

Yang has the sequence of integers 1,2,…,20171,2, \ldots, 2017. He makes 2016 swaps in order, where a swap changes the positions of two integers in the sequence. His goal is to end with 2,3,…,2017,12,3, \ldots, 2017,1. How many different sequences of swaps can Yang do to achieve his goal?
Plain-text mathematical notation (without MathML)
Yang has the sequence of integers 1,2,…,2017. He makes 2016 swaps in order, where a swap changes the positions of two integers in the sequence. His goal is to end with 2,3,…,2017,1. How many different sequences of swaps can Yang do to achieve his goal?
Original LaTeX notation
Yang has the sequence of integers $1,2, \ldots, 2017$. He makes 2016 swaps in order, where a swap changes the positions of two integers in the sequence. His goal is to end with $2,3, \ldots, 2017,1$. How many different sequences of swaps can Yang do to achieve his goal?

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
94925dd8-d878-564b-be9c-175220db5693
task_key
test--94925dd8-d878-564b-be9c-175220db5693
task_revision_id
1
config / split
/ test

Official source

initial import