benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Compute the number of ways there are to assemble 2 red unit cubes and 25 white…

Problem

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

problem

Compute the number of ways there are to assemble 2 red unit cubes and 25 white unit cubes into a 3×3×33 \times 3 \times 3 cube such that red is visible on exactly 4 faces of the larger cube. (Rotations and reflections are considered distinct.)
Plain-text mathematical notation (without MathML)
Compute the number of ways there are to assemble 2 red unit cubes and 25 white unit cubes into a 3×3×3 cube such that red is visible on exactly 4 faces of the larger cube. (Rotations and reflections are considered distinct.)
Original LaTeX notation
Compute the number of ways there are to assemble 2 red unit cubes and 25 white unit cubes into a $3 \times 3 \times 3$ cube such that red is visible on exactly 4 faces of the larger cube. (Rotations and reflections are considered distinct.)

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
547cca2a-132c-542a-af49-9d085997b352
task_key
test--547cca2a-132c-542a-af49-9d085997b352
task_revision_id
1
config / split
/ test

Official source

initial import