benchmarks.wiki / Public workspace

Omni-MATH / Let n>0 be an integer. Each face of a regular tetrahedron is painted in one of n colors (the faces are not necessarily painted different colors.) Suppose there are n³ possible colo…

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. Each face of a regular tetrahedron is painted in one of nn colors (the faces are not necessarily painted different colors.) Suppose there are n3n^{3} possible colorings, where rotations, but not reflections, of the same coloring are considered the same. Find all possible values of nn.
Plain-text mathematical notation (without MathML)
Let n>0 be an integer. Each face of a regular tetrahedron is painted in one of n colors (the faces are not necessarily painted different colors.) Suppose there are n³ possible colorings, where rotations, but not reflections, of the same coloring are considered the same. Find all possible values of n.
Original LaTeX notation
Let $n>0$ be an integer. Each face of a regular tetrahedron is painted in one of $n$ colors (the faces are not necessarily painted different colors.) Suppose there are $n^{3}$ possible colorings, where rotations, but not reflections, of the same coloring are considered the same. Find all possible values of $n$.

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