benchmarks.wiki / Public workspace

Omni-MATH / Carl is on a vertex of a regular pentagon. Every minute, he randomly selects an…

Problem

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

problem

Carl is on a vertex of a regular pentagon. Every minute, he randomly selects an adjacent vertex (each with probability 12\frac{1}{2} ) and walks along the edge to it. What is the probability that after 10 minutes, he ends up where he had started?
Plain-text mathematical notation (without MathML)
Carl is on a vertex of a regular pentagon. Every minute, he randomly selects an adjacent vertex (each with probability (1)/(2) ) and walks along the edge to it. What is the probability that after 10 minutes, he ends up where he had started?
Original LaTeX notation
Carl is on a vertex of a regular pentagon. Every minute, he randomly selects an adjacent vertex (each with probability $\frac{1}{2}$ ) and walks along the edge to it. What is the probability that after 10 minutes, he ends up where he had started?

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