Summation Equation, Trying to solve this recurrence forumla.

  • Context: Graduate 
  • Thread starter Thread starter bobbybob
  • Start date Start date
  • Tags Tags
    Recurrence Summation
Click For Summary
SUMMARY

The discussion centers on solving a recursive formula for predicting the number of cups hit in beer pong based on shot percentage. The recursive formula is defined as C(t) = C(a^2 * t) + 2at, where 0 < a < 1. The summation equation derived from this problem is ∑ (2a^(2i+1)) from i = 0 to infinity. The final formula for the expected number of cups hit is a/(1-a), which incorporates the probabilities of making consecutive shots and the resulting extra turns.

PREREQUISITES
  • Understanding of recursive formulas and their applications
  • Familiarity with summation notation and infinite series
  • Knowledge of probability theory, specifically geometric distributions
  • Basic calculus concepts, including derivatives and series convergence
NEXT STEPS
  • Study recursive sequences and their solutions in mathematical contexts
  • Learn about infinite series and convergence criteria
  • Explore probability theory, focusing on geometric and binomial distributions
  • Review calculus, particularly differentiation of power series
USEFUL FOR

Mathematicians, statisticians, game theorists, and anyone interested in probability modeling and recursive functions.

bobbybob
Messages
2
Reaction score
0
Hello. I've searched around a bit for a math forum where I could get help with this and this seems like the one I found where I could get some help with this. I was posed the following problem. Now I must admit it is over my head (as is most of the math on this forum) I was hoping that someone here could help give me an answer for this person. Or if not an answer, a reason why his probem makes no sense.

I want to predict the number of cups to be hit in beer pong each round, based upon shot percentage.

It's not just number of shots * percentage, because if you make 2 shots in a row, you get an extra turn. Even your extra turns can get extra turns..

Therefore, Number of cups per round is the recursive formula

C(t) = C(a^2 * t) + 2at where 0 < a < 1 for accuracy

So if you want to find the number of cups in 1 round, calculate c(1)
This can actually be reduced to the summation equation

for i = 0 to infinity -> 2a^(2i+1)

How do I solve this summation and get a formula?
I'd really appreciate it,

Thanks.
 
Physics news on Phys.org
You either miss your first shot, OR make your first and miss the next, OR make your first two and miss the next OR ... OR make the first n and miss the next OR ...

The probability that you make the first n and miss the next is an(1-a).

So what you want is the sum of (getting n cups) x (probability of getting n cups) for all n, i.e.:

[tex]\sum _{n=0}^{\infty}na^n(1-a) = (1-a)\sum _{n=0}^{\infty}na^n = (1-a)\sum _{n=1}^{\infty}na^n = a(1-a)\sum_{n=1}^{\infty}na^{n-1} = a(1-a)f'(a)[/tex]

where

[tex]f(x) = \sum_{n=1}^{\infty}x^n = \sum_{n=0}^{\infty}x^n - 1 = \frac{1}{1-x} - 1 = \frac{x}{1-x}[/tex]

So

[tex]f'(x) = \frac{(1-x) - x(-1)}{(1-x)^2} = \frac{1}{(1-x)^2}[/tex]

So

[tex]f'(a) = \frac{1}{(1-a)^2}[/tex]

Finally, the desired number is:

[tex]a(1-a)\frac{1}{(1-a)^2} = \frac{a}{1-a}[/tex]
 
thank you very much
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 1 ·
Replies
1
Views
7K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 3 ·
Replies
3
Views
6K