benchmarks.wiki / Public workspace

Omni-MATH / On floor 0 of a weird-looking building, you enter an elevator that only has one…

Problem

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

problem

On floor 0 of a weird-looking building, you enter an elevator that only has one button. You press the button twice and end up on floor 1. Thereafter, every time you press the button, you go up by one floor with probability XY\frac{X}{Y}, where XX is your current floor, and YY is the total number of times you have pressed the button thus far (not including the current one); otherwise, the elevator does nothing. Between the third and the 100th 100^{\text {th }} press inclusive, what is the expected number of pairs of consecutive presses that both take you up a floor?
Plain-text mathematical notation (without MathML)
On floor 0 of a weird-looking building, you enter an elevator that only has one button. You press the button twice and end up on floor 1. Thereafter, every time you press the button, you go up by one floor with probability (X)/(Y), where X is your current floor, and Y is the total number of times you have pressed the button thus far (not including the current one); otherwise, the elevator does nothing. Between the third and the 100^(th ) press inclusive, what is the expected number of pairs of consecutive presses that both take you up a floor?
Original LaTeX notation
On floor 0 of a weird-looking building, you enter an elevator that only has one button. You press the button twice and end up on floor 1. Thereafter, every time you press the button, you go up by one floor with probability $\frac{X}{Y}$, where $X$ is your current floor, and $Y$ is the total number of times you have pressed the button thus far (not including the current one); otherwise, the elevator does nothing. Between the third and the $100^{\text {th }}$ press inclusive, what is the expected number of pairs of consecutive presses that both take you up a floor?

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