The document discusses the ballot problem of counting votes for multiple candidates. It defines the ballot problem for two candidates, where the formula to count the number of ways ballots can be arranged such that one candidate is always ahead is (a+b choose a). It notes this has been proved for two candidates. The objective is to find the formula and proof for many candidates. It provides examples and formulas for counting ballots for three candidates, and conjectures a formula for n candidates proved by strong mathematical induction. Applications in biology and cryptography are also mentioned.