benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / In general, if there are d doors in every room (but still only 1 correct door) and r rooms, the last of which leads into Bowser's level, what is the expected number of doors throug…

Problem

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

problem

In general, if there are dd doors in every room (but still only 1 correct door) and rr rooms, the last of which leads into Bowser's level, what is the expected number of doors through which Mario will pass before he reaches Bowser's level?
Plain-text mathematical notation (without MathML)
In general, if there are d doors in every room (but still only 1 correct door) and r rooms, the last of which leads into Bowser's level, what is the expected number of doors through which Mario will pass before he reaches Bowser's level?
Original LaTeX notation
In general, if there are $d$ doors in every room (but still only 1 correct door) and $r$ rooms, the last of which leads into Bowser's level, what is the expected number of doors through which Mario will pass before he reaches Bowser's level?

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
8070adb1-a410-566c-95e3-f21d86a0ceb2
task_key
test--8070adb1-a410-566c-95e3-f21d86a0ceb2
task_revision_id
1
config / split
/ test

Official source

initial import