benchmarks.wiki / Public workspace

Omni-MATH / Bob writes a random string of 5 letters, where each letter is either A,B,C, or D. The letter in each position is independently chosen, and each of the letters A,B,C,D is chosen wit…

Problem

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

problem

Bob writes a random string of 5 letters, where each letter is either A,B,CA, B, C, or DD. The letter in each position is independently chosen, and each of the letters A,B,C,DA, B, C, D is chosen with equal probability. Given that there are at least two AA 's in the string, find the probability that there are at least three AA 's in the string.
Plain-text mathematical notation (without MathML)
Bob writes a random string of 5 letters, where each letter is either A,B,C, or D. The letter in each position is independently chosen, and each of the letters A,B,C,D is chosen with equal probability. Given that there are at least two A 's in the string, find the probability that there are at least three A 's in the string.
Original LaTeX notation
Bob writes a random string of 5 letters, where each letter is either $A, B, C$, or $D$. The letter in each position is independently chosen, and each of the letters $A, B, C, D$ is chosen with equal probability. Given that there are at least two $A$ 's in the string, find the probability that there are at least three $A$ 's in the string.

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