benchmarks.wiki / Public workspace

MATH / Each face of a cube is assigned a different integer. Then each vertex is…

Problem

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

problem

Each face of a cube is assigned a different integer. Then each vertex is assigned the sum of the integer values on the faces that meet at the vertex. Finally, the vertex numbers are added. What is the largest number that must divide the final sum for every possible numbering of the faces?

level

Level 5

type

Number Theory

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