Ask The Wizard #378
A farmer owns a square plot of land measuring 1x1. He intends to distribute it fairly among his three children. To achieve this, he is allowed to use, at most, three straight fencing sections. What would be the best way for him to arrange this to keep the fencing as short as possible?
Here is my solution (PDF).
This topic is being brought up and explored in my discussion forum at Wizard of Vegas .
Amy, Barbara, and Chrissy have chosen to play a game of tag. They all begin from the same point in an open field, and their respective running speeds, measured in feet per minute, are as follows:
- Amy: 500
- Barbara: 400
- Chrissy: 300
Amy is designated as 'it' first. As she begins a one-minute countdown, Barbara and Chrissy dash off in opposite directions and maintain that trajectory.
Which of the two girls should Amy pursue first in order to minimize the overall time it takes to tag both Barbara and Chrissy? Additionally, for extra credit, what is the time taken for both routes?
The most efficient strategy is for her to chase after Chrissy first. Here's the time it would take for both scenarios:
Barbara first: 7.5 minutesChrissy first: 6 minutes
You have a set of ten icosahedrons, each with sides labeled from 1 to 20, and you roll all of them. What is the average roll for the die that shows the highest value?
The following chart presents the number of combinations for any specified total. The corresponding formula for this is n raised to the power of 10 minus (n-1) raised to the power of 10. The additional two columns illustrate the probability and contributions to the expected return. The lower right cell reflects an average value of 18.640276.
Highest side | Combinations | Probability | Return |
1 | 1 | 0.000000 | 0.000000 |
2 | 1,023 | 0.000000 | 0.000000 |
3 | 58,025 | 0.000000 | 0.000000 |
4 | 989,527 | 0.000000 | 0.000000 |
5 | 8,717,049 | 0.000001 | 0.000004 |
6 | 50,700,551 | 0.000005 | 0.000030 |
7 | 222,009,073 | 0.000022 | 0.000152 |
8 | 791,266,575 | 0.000077 | 0.000618 |
9 | 2,413,042,577 | 0.000236 | 0.002121 |
10 | 6,513,215,599 | 0.000636 | 0.006361 |
11 | 15,937,424,601 | 0.001556 | 0.017120 |
12 | 35,979,939,623 | 0.003514 | 0.042164 |
13 | 75,941,127,625 | 0.007416 | 0.096410 |
14 | 151,396,163,127 | 0.014785 | 0.206987 |
15 | 287,395,735,649 | 0.028066 | 0.420990 |
16 | 522,861,237,151 | 0.051061 | 0.816971 |
17 | 916,482,272,673 | 0.089500 | 1.521504 |
18 | 1,554,473,326,175 | 0.151804 | 2.732473 |
19 | 2,560,599,031,177 | 0.250058 | 4.751111 |
20 | 4,108,933,742,199 | 0.401263 | 8.025261 |
Total | 10,240,000,000,000 | 1.000000 | 18.640276 |
I'm not aware of a formula that can provide a solution without utilizing a summation notation. If you happen to know one, please share it with me.