benchmarks.wiki / Public workspace

Omni-MATH / The English alphabet, which has 26 letters, is randomly permuted. Let p₁ be the probability that AB,CD, and EF all appear as contiguous substrings. Let p₂ be the probability that …

Problem

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

problem

The English alphabet, which has 26 letters, is randomly permuted. Let p1p_{1} be the probability that AB,CD\mathrm{AB}, \mathrm{CD}, and EF\mathrm{EF} all appear as contiguous substrings. Let p2p_{2} be the probability that ABC\mathrm{ABC} and DEF\mathrm{DEF} both appear as contiguous substrings. Compute p1p2\frac{p_{1}}{p_{2}}.
Plain-text mathematical notation (without MathML)
The English alphabet, which has 26 letters, is randomly permuted. Let p₁ be the probability that AB,CD, and EF all appear as contiguous substrings. Let p₂ be the probability that ABC and DEF both appear as contiguous substrings. Compute (p₁)/(p₂).
Original LaTeX notation
The English alphabet, which has 26 letters, is randomly permuted. Let \(p_{1}\) be the probability that \(\mathrm{AB}, \mathrm{CD}\), and \(\mathrm{EF}\) all appear as contiguous substrings. Let \(p_{2}\) be the probability that \(\mathrm{ABC}\) and \(\mathrm{DEF}\) both appear as contiguous substrings. Compute \(\frac{p_{1}}{p_{2}}\).

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