maths.free › Discrete Math & Logic › 13. Math and... › Math and Sports
Math and Sports
Describe why data analytics (statistics) is crucial to advance a team’s success.
Learning Objectives
After completing this section, you should be able to:
- Describe why data analytics (statistics) is crucial to advance a team’s success.
- Describe single round-robin method of tournaments.
- Describe single-elimination method of tournaments.
- Explore math in baseball, fantasy football, hockey, and soccer (projects at the end of the section).
Data Analytics (Statistics) Is Crucial to Advance a Team’s Success
Analyzing the vast data that today’s world has amassed to find patterns and to make predictions for future results has created a degree field for data analytics at many colleges, which is in high demand in places that might surprise you. One such place is in sports, where being able to analyze the available data on your team’s players, potential recruits, opposing team strategies, and opposing players can be paramount to your team’s success.
Hollywood turned the notion of using data analytics into a major motion picture back in 2011 with the release of Moneyball, starring Brad Pitt, which grossed over $110 million. The critically acclaimed movie, based on a true story as shared in a book by Michael Lewis, follows the story of a general manager for the Oakland Athletics who used data analytics to take a team comprised of relatively unheard of players to ultimately win the American League West title in a year’s time. The win caught the eye of other team managers and owners, which started an avalanche of other teams digging into the data of players and teams.
In today’s world of sports, a team has multiple positions utilizing data analytics from road scouts who evaluate a potential recruit’s skills and potential to the ultimate position of general manager who is typically the highest-paid (non-player) employee with the exception of the coaches. Being able to understand and evaluate the available data is big business and is a highly sought after skill set. In college and professional sports, it is no longer sufficient to have a strong playbook and great players. The science to winning is in understanding the math of the data and using it to propel your team to excelling.
Single Round-Robin Tournaments
A common tournament style is single round-robin tournaments (), where each team or opponent plays every other team or opponent, and the champion is determined by the team that wins the most games. Ties are possible and are resolved based on league rules.
An advantage of the round-robin tournament style is that no one team has the advantage of seeding, which eliminates some teams from playing against each other based on rank of their prior performance. Rather, each team plays every other team, providing equal opportunity to triumph over each team. In this sense, round-robin tournaments are deemed the fairest tournament style.
One hindrance to employing a round-robin-style tournament is the potential for the number of games involved in tournament play to determine a winner. Determining the number of games can be found easily using a formula which, as we will see, can quickly grow in the number of games required for a single round-robin tournament.
Calculating the Number of Games in Single Round-Robin Tournaments
Try it.
Find the number of games in a single round-robin tournament for each of the following numbers of teams:
- 4 teams
- 8 teams
- 20 teams
Solution
- Using the formula with 4 teams yields \(4(4-1)/2=6\) tournament games.
- Using the formula with 8 teams yields \(8(8-1)/2=28\) tournament games.
- Using the formula with 20 teams yields \(20(20-1)/2=190\) tournament games.
As the examples show, single round-robin tournament play can quickly grow in the number of games required to determine a champion. As such, some tournaments elect to employ variations of single round-robin tournament play as well as other tournament styles such as elimination tournaments.
Single-Elimination Tournaments
When desiring a more efficient tournament style to determine a champion, one option is single-elimination tournaments (), where teams are paired up and the winner advances to the next round of play. The losing team is defeated from tournament play and does not advance in the tournament, although some leagues offer consolation matches.
Calculating the Number of Games in Single-Elimination Tournaments
Try it.
Find the number of games in a single-elimination tournament for each of the following numbers of teams:
- 4 teams
- 8 teams
- 20 teams
Solution
- Using the formula with 4 teams yields \((4-1)=3\) tournament games.
- Using the formula with 8 teams yields \((8-1)=7\) tournament games.
- Using the formula with 20 teams yields \((20-1)=19\) tournament games.
A single-elimination tournament offers an advantage over single round-robin tournament style of play in the number of games needed to complete the tournament. As you can see, in comparing the number of games in a single round-robin tournament in with the number of games in single-elimination tournament as shown in , the number of games required for single round-robin can quickly become unmanageable to schedule.
There are modifications to both the round-robin and elimination tournament styles such as double round-robin and double-elimination tournaments. Next time you observe a college or professional sporting event, see if you can determine the tournament style of play.
Key Concepts
- Describe how a round-robin tournament is organized.
- Compute the number of games played in a round-robin tournament.
- Describe how a single-elimination tournament is organized.
- Compute the number of games played in a single-elimination tournament.
Formulas
Number of games in a single round-robin tournament with \(n\) teams is \(n(n-1)/2\).
Number of games in a single-elimination tournament with \(n\) teams is \((n-1)\).
project
The Lucas numbers bear some similarity to the Fibonacci numbers and exhibit a stronger link to the golden ratio. Edouard Lucas is credited with naming the Fibonacci numbers and the Lucas numbers were so named in his honor. The Lucas numbers play a role in finding prime numbers that are utilized in encrypting data for actions such as using your debit card to obtain money at a cash machine or when making a credit card purchase for point of sale as well as when shopping online.
Complete the following questions to explore numbers in the Lucas sequence as well as their relationships to the numbers in the Fibonacci sequence.
- Conduct an Internet search to find out what a Lucas number is and how the Lucas numbers are related to the Fibonacci numbers.
- What are the first two numbers in the Lucas sequence?
- Describe how the next number in the Lucas sequence is determined and compare this to how the next number is determined in the Fibonacci sequence.
- Complete the following table listing the first 10 terms in the Fibonacci and Lucas sequence:
Term \(0\) \(1\) \(2\) \(3\) \(4\) \(5\) \(6\) \(7\) \(8\) \(9\) Fibonacci Numbers \(0\) \(1\) \(1\) \(2\) \(5\) \(13\) \(34\) Lucas Numbers \(3\) \(7\) \(18\) \(47\) - Interestingly, many patterns can be found in looking at the relationships in the Fibonacci and Lucas numbers. Look closely at the chart in question 3 to discover one such pattern. Observe the Fibonacci numbers in the third and fifth terms and compare with the Lucas number in the fourth term of the sequence. Describe the pattern found. Does this pattern continue in the table?
- Research the Fibonacci or the Lucas numbers to find an application in our world distinct from what has been shared in this project and section. Write a paragraph sharing the findings of your research.
Condensed — the full section is in OpenStax Contemporary Mathematics.
Practice (2)
Try each one on paper first. Reveal the answer to check; verified ones can be opened in the solver for every step.
-
Find the number of games in a single round-robin tournament for each of the following numbers of teams:
- 4 teams
- 8 teams
- 20 teams
@ action
- Using the formula with 4 teams yields \(4(4-1)/2=6\) tournament games.
- Using the formula with 8 teams yields \(8(8-1)/2=28\) tournament games.
- Using the formula with 20 teams yields \(20(20-1)/2=190\) tournament games.
-
Find the number of games in a single-elimination tournament for each of the following numbers of teams:
- 4 teams
- 8 teams
- 20 teams
@ action
- Using the formula with 4 teams yields \((4-1)=3\) tournament games.
- Using the formula with 8 teams yields \((8-1)=7\) tournament games.
- Using the formula with 20 teams yields \((20-1)=19\) tournament games.
Symbols used here
n × (n−1) × … × 1; the number of orderings of n things. 0! = 1.
Number of k-element subsets of n things: n!/(k!(n−k)!).
Add a_k for k = 1 up to n.
x belongs to A; every element of A is in B.
In either; in both; in A but not B.
The set with no elements; the number of elements of A.
Quantifiers: every x; at least one x.
Logical connectives.
Marks the point where the statement has been established.
n divides a − b; a and b have the same remainder.
Grows no faster than n² (up to a constant), for large n.
What is left after dividing a by n.
How to: Math and Sports
- Describe why data analytics (statistics) is crucial to advance a team’s success.
- Describe single round-robin method of tournaments.
- Describe single-elimination method of tournaments.
- Explore math in baseball, fantasy football, hockey, and soccer (projects at the end of the section).
- 4 teams
- 8 teams
- 20 teams
- Using the
Questions people ask
What makes mathematics "discrete"?
It deals with separate, countable objects — integers, graphs, statements — rather than continuous quantities. No limits, no infinitesimals; instead induction, counting and logic.
How does a proof by induction work?
Show the statement for the first case, then show that whenever it holds for n it holds for n + 1. Like dominoes: the first falls, and each knocks over the next.
QDialogButtonBox
Parts of this page are adapted from OpenStax Contemporary Mathematics (CC BY-NC-SA 4.0). Condensed and re-explained here; errors are ours.
@ action Discrete Math & Logic
Truth tablesSums and inductionProof by inductionAlgorithms and growth of functions