MHB Percentages of success in basketball

  • Thread starter Thread starter Yankel
  • Start date Start date
  • Tags Tags
    Basketball
Yankel
Messages
390
Reaction score
0
Hello all,

I wasn't sure if this question should be placed here or on algebra forum, but it is related to probability, so I put it here.

A basketball player shoots several times during some time period in a game, and scores less than 80% of his shots (let's say after the first quarter, but the time doesn't really matters). At the end of the game, he scored more than 80% of his shots. Is it necessary that at some point during the game, his success was exactly 80% ?

My intuition say that the answer is no, because this is not a continuous function, but every example I tried setting up, showed that 80% was achieved. What do you think ?
 
Mathematics news on Phys.org
Yankel said:
Hello all,

I wasn't sure if this question should be placed here or on algebra forum, but it is related to probability, so I put it here.

A basketball player shoots several times during some time period in a game, and scores less than 80% of his shots (let's say after the first quarter, but the time doesn't really matters). At the end of the game, he scored more than 80% of his shots. Is it necessary that at some point during the game, his success was exactly 80% ?

My intuition say that the answer is no, because this is not a continuous function, but every example I tried setting up, showed that 80% was achieved. What do you think ?

Your correct that the answer is no. In terms of finding an example to show this the easiest way is to find some fraction that is greater than and not equal to 80% where subtracting one from the numerator and one from the denominator is less than and not equal to 80%. In other words find a fraction such that making the last shot pushes them over 80% success and that before making the last shot they had less than 80% success.

Find an x,y such that
$$\frac{x}{y} > 80%$$ and
$$\frac{x-1}{y-1} < 80%$$
 
Actually, I think the claim is true. First, I tried some elementary examples and they appeared to be true so my intuition was that the claim should be true. Suppose that he shots $n$ times during the game, then each time he shots we can compute his succes rate. The game starts and he shots ... he scores, then his succes rate at that time is $1/1 = 100\%$. Suppose he shots again after a few minutes but misses then his succes rate is now $1/2 = 50\%$. So in fact, you can represent the game as a finite sequence
$$\left(\frac{a_i}{i}\right)_{i=1}^{n},$$
where the $a_i's$ are increasing by one but not necessarily each consecutive term.

Statement
The question can then be reformulated as: given that $a_n/n > (4/5)$ and at some point in the game $a_j/j < (4/5)$ for $j<n$. Does this imply that there exists an index $k$ such that $a_k /k = 0.8$ where $j<k<n$?

Proof
​The answer is yes. We have given $\displaystyle \frac{a_n}{n} > \frac{4}{5} > \frac{a_j}{j}$. Hence, $5a_n>4n$ and $5a_j < 4j$. Let $b_k=5a_k-4k$. As $a_{k+1}$ is either $a_k$ or $a_k+1$, we have $$b_{k+1}=5a_{k+1}-4k-4=\begin{cases}5a_k-4k-4&=b_k-4\quad \text{ or}\\5(a_k+1)-4k-4&=b_k+1\end{cases}$$Thus if the integer $b_k$ increases, it only increases in steps of $1$. From $b_j<0<b_n$ we see that there must be a ​first index $k$ between $j$ and $n$ for which $b_k\ge 0$. Then $b_k\le b_{k-1}+1$ and $b_{k-1}<0$, hence $b_k=0$ as desired.

Please, correct me if I am wrong.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top