benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let X be as in problem 13. Let Y be the number of ways to order X crimson flowers, X scarlet flowers, and X vermillion flowers in a row so that no two flowers of the same hue are a…

Problem

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

problem

Let XX be as in problem 13. Let YY be the number of ways to order XX crimson flowers, XX scarlet flowers, and XX vermillion flowers in a row so that no two flowers of the same hue are adjacent. (Flowers of the same hue are mutually indistinguishable.) Find YY.
Plain-text mathematical notation (without MathML)
Let X be as in problem 13. Let Y be the number of ways to order X crimson flowers, X scarlet flowers, and X vermillion flowers in a row so that no two flowers of the same hue are adjacent. (Flowers of the same hue are mutually indistinguishable.) Find Y.
Original LaTeX notation
Let $X$ be as in problem 13. Let $Y$ be the number of ways to order $X$ crimson flowers, $X$ scarlet flowers, and $X$ vermillion flowers in a row so that no two flowers of the same hue are adjacent. (Flowers of the same hue are mutually indistinguishable.) Find $Y$.

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
6dfdfa89-be45-5c71-a907-3a0d62101fd9
task_key
test--6dfdfa89-be45-5c71-a907-3a0d62101fd9
task_revision_id
1
config / split
/ test

Official source

initial import