Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Every reachable sequence is a restricted-growth sequence in . Given one, the transition masses sum to
and every allowed transition remains in . Induction from therefore proves that almost surely.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. A
  2. 10F
  3. Paper 2
  4. Ia
  5. 2025
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home