benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Augustin has six 1×2×π bricks. He stacks them, one on top of another, to form a tower six bricks high. Each brick can be in any orientation so long as it rests flat on top of the n…

Problem

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

problem

Augustin has six 1×2×π1 \times 2 \times \pi bricks. He stacks them, one on top of another, to form a tower six bricks high. Each brick can be in any orientation so long as it rests flat on top of the next brick below it (or on the floor). How many distinct heights of towers can he make?
Plain-text mathematical notation (without MathML)
Augustin has six 1×2×π bricks. He stacks them, one on top of another, to form a tower six bricks high. Each brick can be in any orientation so long as it rests flat on top of the next brick below it (or on the floor). How many distinct heights of towers can he make?
Original LaTeX notation
Augustin has six $1 \times 2 \times \pi$ bricks. He stacks them, one on top of another, to form a tower six bricks high. Each brick can be in any orientation so long as it rests flat on top of the next brick below it (or on the floor). How many distinct heights of towers can he make?

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
95bfee61-ac77-5764-ade0-ae34d1c90b57
task_key
test--95bfee61-ac77-5764-ade0-ae34d1c90b57
task_revision_id
1
config / split
/ test

Official source

initial import