Football season is in full swing, and every week searches spike for the schedule and for the big divisional matchups. If you stare at enough box scores, you notice a pattern: 17, 20, 23, 24 and 27 show up all the time, while 1 never does. That is not luck. Every final score hides a classic number theory question: which integers can you build by adding up fixed values?
What each scoring play is worth
Under pro football rules, a touchdown is worth 6 points. After it, the offense tries a conversion: the extra-point kick is worth 1, and a two-point conversion is worth 2. A field goal is worth 3 and a safety is worth 2. Bundling the touchdown with its try, a complete scoring play is worth 2, 3, 6, 7 or 8 points.
The single point never shows up on its own; it only exists on top of a touchdown. So for final scores, the set that matters is .
The concept: linear combinations with nonnegative coefficients
A score is possible when there are nonnegative integers (how many times each play happened) such that:
Notice that 6, 7 and 8 add nothing new: 6 = 3 + 3, 7 = 2 + 2 + 3, and 8 = 2 + 3 + 3. So you only need 2 and 3. Every even number from 2 up is a stack of 2s; every odd number from 3 up is one 3 plus some 2s. Bottom line: every integer is reachable, and 1 is the only gap (besides 0, which is just a shutout).
The coin problem (a.k.a. the chicken nugget problem)
Now picture a made-up league where the only scoring plays are worth 3 and 7. That is the sports version of the coin problem: with coins worth 3 and 7 cents, which amounts can you pay exactly? Many people know it as the chicken nugget problem, after boxes sold in fixed sizes.
Two facts drive everything. First, if , only multiples of are reachable, so infinitely many numbers are missed. Second, if , there is a largest impossible number, called the Frobenius number:
For 3 and 7, . The count of impossible scores has a formula too: , which gives 6. Sure enough, the list is 1, 2, 4, 5, 8 and 11.
Worked example: how many ways to reach 24?
In the made-up 3-and-7 league, a team finished with 24 points. Which combinations of plays could produce that? We want the nonnegative integer solutions of .
- Since b multiplies the bigger value, it has few options: 7b cannot exceed 24, so b is 0, 1, 2 or 3.
- Filter with divisibility: 24 - 7b must be a multiple of 3. Since 7 leaves remainder 1 when divided by 3 and 24 leaves remainder 0, b must be a multiple of 3.
- That leaves b = 0 and b = 3.
- For b = 0: 3a = 24, so a = 8 (eight 3-point plays).
- For b = 3: 3a = 24 - 21 = 3, so a = 1 (one 3-point play and three 7-point plays).
- Check: 3 × 8 + 7 × 0 = 24 and 3 × 1 + 7 × 3 = 3 + 21 = 24. Both combinations work, and there are no others.
Why everything from 12 on works
The argument is short: 12 = 3 × 4, 13 = 3 × 2 + 7, and 14 = 7 × 2. That is three consecutive reachable numbers. Adding one 3-point play moves each of them to the next number with the same remainder mod 3, so 15, 16, 17 and everything after are reachable too. Three in a row is enough because the smallest play is 3. It is the same induction idea you see in divisibility proofs.
Common mistakes
- Assuming gcd 1 means everything works. It guarantees that everything past some point is reachable, not every number. With 3 and 7, 11 is still impossible.
- Allowing negative coefficients. The equation has an integer solution (, ), but nobody scores “minus two field goals.” In the coin problem, coefficients must be nonnegative.
- Not checking every value of b. Stopping at the first solution misses combinations, as the 24 example shows.
- Treating the extra point as a standalone play. It depends on a touchdown; counting it separately would wrongly suggest a final score of 1 is possible.
Frequently asked questions
Can a football team finish a game with 1 point?
No. The extra point only exists after a touchdown, and every standalone scoring play is worth 2 or more. Since 2 and 3 generate every integer from 2 up, the only impossible final score is 1.
What is the Frobenius number?
It is the largest integer that cannot be written as a nonnegative combination of the given values. For two values a and b with gcd 1, it equals ab - a - b. For 3 and 7, that is 11.
What if the values share a common factor?
Then only multiples of the gcd are reachable. With plays worth 4 and 6, for example, no odd score is possible, and there is no largest impossible number.
Is there a formula for three or more values?
There is no general closed formula for three or more values. In those cases you use algorithms or remainder arguments, like we did with 2 and 3.