benchmarks.wiki / Public workspace

Omni-MATH / Let n>0 be an integer. We are given a balance and n weights of weight 2⁰,2¹,⋯,2^(n−1). We are to place each of the n weights on the balance, one after another, in such a way that t…

Problem

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

problem

Let n>0n > 0 be an integer. We are given a balance and nn weights of weight 20,21,⋯,2n−12^0, 2^1, \cdots, 2^{n-1}. We are to place each of the nn weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed. Determine the number of ways in which this can be done. [i]
Plain-text mathematical notation (without MathML)
Let n>0 be an integer. We are given a balance and n weights of weight 2⁰,2¹,⋯,2^(n−1). We are to place each of the n weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed.
Determine the number of ways in which this can be done.

[i]
Original LaTeX notation
Let $n > 0$ be an integer. We are given a balance and $n$ weights of weight $2^0, 2^1, \cdots, 2^{n-1}$. We are to place each of the $n$ weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed.
Determine the number of ways in which this can be done.

[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