A Snail Race Problem
Abstract
Inspired by Problem 17 from the 2024 American Mathematics Competition (AMC) 10B, this work focuses on enumerating the distinct outcomes of a snail race with specified number of ties of a certain type. We begin by developing a recurrence relation and subsequently derive a closed-form formula for the number of possible outcomes using the exponential generating function method. Two special cases of the problem are considered in detail. Our analysis also explores the connections between the solution to this problem and the ordered Bell numbers, Stirling numbers of the second kind, and partial Bell polynomials.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.