NumberthonNumberthon

SolveFire POTD

Bronze
combinatorics
6/22/2026
Problems sourced from solvefire.net
Problem
A building elevator starts at the lobby (floor 0), moves exactly one floor up or one floor down each minute, never goes below the lobby, and returns to the lobby after 12 minutes. The maintenance log records an arrival at floor 3 each time the elevator reaches floor 3 after a move. How many possible 12-minute movement logs have exactly two arrivals at floor 3?
Solution ApproachShow

Step-by-step approach

This is a lattice path problem: Dyck-like paths from 0 to 0 in 12 steps (±1, stay ≥ 0) that touch height 3 exactly twice. Use the transfer matrix method or the reflection principle to count such paths.

Ready for more competition problems?

Practice the full SolveFire course and compete in ranked math battles — free to play.