Ask The Wizard #401
Imagine that hitting a basket from the half-court line in basketball has a success rate of only 1%. On average, how many tries would it take to score three times consecutively?
What is the universal formula that can be applied to any probability and any desired number of consecutive successes?
Let's let:
- a=the anticipated additional shots needed, assuming the previous attempt was a failure.
- b=the anticipated additional shots needed, assuming the last attempt was successful.
- c=the anticipated additional shots needed, assuming the last two attempts were successful.
We can create the following equations to transition from one state to another:
a = 1 + 0.01b + 0.99a
b = 1 + 0.01c + 0.99a
c = 1 + (1-p)a
We now possess three equations and three variables, allowing us to determine the solution. I personally favor the use of matrix algebra.
Without delving into a full lesson on the topic, the solution can be derived from the ratio of the determinants, expressed as determ(A)/determ(B). The elements in these matrices originate from the three equations mentioned earlier.
The result of this determinant ratio is 101010.
As for the second inquiry, the formula for any given probability p and a required number n of successful attempts in a row is:
(1/p)^n + (1/p)^(n-1) + (1/p)^(n-2) + .. + (1/p)^2 + (1/p)^1
In this particular scenario, applying the general formula yields the result as 100^3 + 100^2 + 100^1 = 1000000 + 10000 + 100 = 1010100.
This question has been raised and debated in my discussion forum at Wizard of Vegas .
From a standard deck, 13 cards from a selected suit are removed. Then, each logician, Alex and Bob, is dealt one card. In this setup, 2's are considered low cards while aces are regarded as high. Each logician is entitled to review their own card. Following that, Alex can propose a switch to Bob. If the switch is offered, Bob has the choice to either accept or decline. What strategy should both players ideally adopt?
To explore my thoughts on this, I experimented with a variety of strategies.
If Alex decides to switch holding a 4 or lower, Bob should accept if he has a 2 and remain neutral if holding a 3. In this case, Bob's likelihood of winning would be 56.7%.
If Alex switches with a card valued at 3 or lower, Bob should only accept if he has a 2. This gives Bob a winning probability of 53.3%.
If Alex presents a switch while holding a 2, Bob should always decline the offer, which leaves him with a winning probability of 50.0%.
The observed trend is that Bob ought to be more selective about accepting switches than Alex. If Alex attempts to switch with a card of value 3 or above, Bob can benefit from a lower threshold for switching. The only way for Alex to avoid being outplayed is by switching exclusively with a 2. This knowledge would lead Bob to never accept such an offer. Therefore, if the game is played between two logicians, Alex should solely propose to switch if he possesses a 2, while Bob should consistently refuse any offer made.
Nevertheless, in the rare situation where Bob does have a 2 and is offered a switch, it would be logical for him to accept, as he might suspect that Alex has either misinterpreted his card or is not truly employing logical reasoning.
This question has been raised and debated in my discussion forum at Wizard of Vegas .
What is the average number of spins required in roulette before a number repeats?
You didn’t specify the type of roulette wheel, but I will provide results for all three varieties:
- Single Zero = 8.306669466
- Double Zero = 8.408797212
- Triple Zero = 8.509594851
The table below indicates the likelihood of the first number repetition occurring at each spin across all three types of wheels.
Probability of Repeat Number
Spin | Single Zero |
Double Zero |
Triple Zero |
---|---|---|---|
1 | 0.0000000000 | 0.0000000000 | 0.0000000000 |
2 | 0.0270270270 | 0.0263157895 | 0.0256410256 |
3 | 0.0525931337 | 0.0512465374 | 0.0499671269 |
4 | 0.0746253924 | 0.0728240268 | 0.0711070652 |
5 | 0.0914329132 | 0.0894330154 | 0.0875163879 |
6 | 0.1019353424 | 0.1000237672 | 0.0981754352 |
7 | 0.1057923554 | 0.1042352943 | 0.1027066091 |
8 | 0.1034096446 | 0.1024066049 | 0.1013898577 |
9 | 0.0958236089 | 0.0954768346 | 0.0950762036 |
10 | 0.0844931146 | 0.0847985044 | 0.0850200666 |
11 | 0.0710452616 | 0.0719051646 | 0.0726667236 |
12 | 0.0570282235 | 0.0582810281 | 0.0594376534 |
13 | 0.0437169674 | 0.0451747682 | 0.0465525677 |
14 | 0.0320000324 | 0.0334848063 | 0.0349144258 |
15 | 0.0223534530 | 0.0237240530 | 0.0250667672 |
16 | 0.0148879175 | 0.0160538705 | 0.0172161863 |
17 | 0.0094424270 | 0.0103646041 | 0.0113008813 |
18 | 0.0056941663 | 0.0063755953 | 0.0070811612 |
19 | 0.0032589823 | 0.0037306115 | 0.0042294718 |
20 | 0.0017665054 | 0.0020725619 | 0.0024039306 |
21 | 0.0009046116 | 0.0010908221 | 0.0012976683 |
22 | 0.0004364140 | 0.0005425405 | 0.0006638073 |
23 | 0.0001977062 | 0.0002542733 | 0.0003209618 |
24 | 0.0000837944 | 0.0001119289 | 0.0001462658 |
25 | 0.0000330845 | 0.0000461035 | 0.0000626155 |
26 | 0.0000121086 | 0.0000176932 | 0.0000250863 |
27 | 0.0000040842 | 0.0000062951 | 0.0000093656 |
28 | 0.0000012609 | 0.0000020644 | 0.0000032419 |
29 | 0.0000003534 | 0.0000006197 | 0.0000010345 |
30 | 0.0000000890 | 0.0000001689 | 0.0000003022 |
31 | 0.0000000199 | 0.0000000414 | 0.0000000802 |
32 | 0.0000000039 | 0.0000000090 | 0.0000000191 |
33 | 0.0000000007 | 0.0000000017 | 0.0000000040 |
34 | 0.0000000001 | 0.0000000003 | 0.0000000007 |
35 | 0.0000000000 | 0.0000000000 | 0.0000000001 |
36 | 0.0000000000 | 0.0000000000 | 0.0000000000 |
37 | 0.0000000000 | 0.0000000000 | 0.0000000000 |
38 | 0.0000000000 | 0.0000000000 | 0.0000000000 |
39 | 0.0000000000 | 0.0000000000 | 0.0000000000 |