Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Consider a frog starting from 0 and jumping from integer to integer. With probability p he makes a jump of +1, with probability (1-p) a jump of -1. Assume .5 < p < 1. Assume each jump is independent. Let B(n,k) denote the binomial coefficient n choose k.
a. How fast will the frog move towards +infinity?
b. How many times on average will the frog visit each non-negative integer?
What is the probability the frog will be at 0 after 2*n jumps?
Combine 1b and 2 to find the sum from 0 to infinity of (x**n)*B(2*n,n). (0 < x < .25).
As usual we ask that you only submit your original work.
We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!
We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com
The answers are:
They can be derived as follows: