benchmarks.wiki / Public workspace

Omni-MATH / Let H be the unit hypercube of dimension 4 with a vertex at (x,y,z,w) for each choice of x,y,z,w∈{0,1}. A bug starts at the vertex (0,0,0,0). In how many ways can the bug move to …

Problem

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

problem

Let H\mathcal{H} be the unit hypercube of dimension 4 with a vertex at (x,y,z,w)(x, y, z, w) for each choice of x,y,z,w∈{0,1}x, y, z, w \in \{0,1\}. A bug starts at the vertex (0,0,0,0)(0,0,0,0). In how many ways can the bug move to (1,1,1,1)(1,1,1,1) by taking exactly 4 steps along the edges of H\mathcal{H}?
Plain-text mathematical notation (without MathML)
Let H be the unit hypercube of dimension 4 with a vertex at (x,y,z,w) for each choice of x,y,z,w∈{0,1}. A bug starts at the vertex (0,0,0,0). In how many ways can the bug move to (1,1,1,1) by taking exactly 4 steps along the edges of H?
Original LaTeX notation
Let $\mathcal{H}$ be the unit hypercube of dimension 4 with a vertex at $(x, y, z, w)$ for each choice of $x, y, z, w \in \{0,1\}$. A bug starts at the vertex $(0,0,0,0)$. In how many ways can the bug move to $(1,1,1,1)$ by taking exactly 4 steps along the edges of $\mathcal{H}$?

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