benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Farmer James wishes to cover a circle with circumference 10π with six different types of colored arcs. Each type of arc has radius 5, has length either π or 2π, and is colored eith…

Problem

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

problem

Farmer James wishes to cover a circle with circumference 10π10 \pi with six different types of colored arcs. Each type of arc has radius 5, has length either π\pi or 2π2 \pi, and is colored either red, green, or blue. He has an unlimited number of each of the six arc types. He wishes to completely cover his circle without overlap, subject to the following conditions: Any two adjacent arcs are of different colors. Any three adjacent arcs where the middle arc has length π\pi are of three different colors. Find the number of distinct ways Farmer James can cover his circle. Here, two coverings are equivalent if and only if they are rotations of one another. In particular, two colorings are considered distinct if they are reflections of one another, but not rotations of one another.
Plain-text mathematical notation (without MathML)
Farmer James wishes to cover a circle with circumference 10π with six different types of colored arcs. Each type of arc has radius 5, has length either π or 2π, and is colored either red, green, or blue. He has an unlimited number of each of the six arc types. He wishes to completely cover his circle without overlap, subject to the following conditions: Any two adjacent arcs are of different colors. Any three adjacent arcs where the middle arc has length π are of three different colors. Find the number of distinct ways Farmer James can cover his circle. Here, two coverings are equivalent if and only if they are rotations of one another. In particular, two colorings are considered distinct if they are reflections of one another, but not rotations of one another.
Original LaTeX notation
Farmer James wishes to cover a circle with circumference $10 \pi$ with six different types of colored arcs. Each type of arc has radius 5, has length either $\pi$ or $2 \pi$, and is colored either red, green, or blue. He has an unlimited number of each of the six arc types. He wishes to completely cover his circle without overlap, subject to the following conditions: Any two adjacent arcs are of different colors. Any three adjacent arcs where the middle arc has length $\pi$ are of three different colors. Find the number of distinct ways Farmer James can cover his circle. Here, two coverings are equivalent if and only if they are rotations of one another. In particular, two colorings are considered distinct if they are reflections of one another, but not rotations of one another.

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
b6bbcddc-3d36-51a9-9479-236a5ef310b8
task_key
test--b6bbcddc-3d36-51a9-9479-236a5ef310b8
task_revision_id
1
config / split
/ test

Official source

initial import