Jamshrivelson

Question: Suppose you have a chain with infinitely many flat (i.e., one-dimensional) links. The first link has length $1,$ and the length of each successive link is a fraction $f$ of the previous link’s length. As you might expect, $f$ is less than $1.$ You place the chain flat on a table and some ink at the very end of the chain (i.e., the end with the infinitesimal links). Initially, the chain forms a straight line segment, and the longest link is fixed in place. From there, the links are constrained to move in a very specific way: The angle between each chain and the next, smaller link is always the same throughout the chain. For example, if the $N^\text{th}$ link and the $N+1^\text{st}$ link form a $40$ degree clockwise angle, then so do the $N+1^\text{st}$ link and the $N+2^\text{nd}$ link. After you move the chain around as much as you can, what shape is drawn by the ink that was at the tail end of the chain? [Solution]

Question: Today marks the beginning of the Summer Olympics! One of the brand-new events this year is sport climbing, in which competitors try their hands (and feet) at lead climbing, speed climbing and bouldering. Suppose the event’s organizers accidentally forgot to place all the climbing holds on and had to do it last-minute for their 10-meter wall (the regulation height for the purposes of this riddle). Climbers won’t have any trouble moving horizontally along the wall. However, climbers can’t move between holds that are more than 1 meter apart vertically. In a rush, the organizers place climbing holds randomly until there are no vertical gaps between climbing holds (including the bottom and top of the wall). Once they are done placing the holds, how many will there be on average (not including the bottom and top of the wall)? Extra credit: Now suppose climbers find it just as difficult to move horizontally as vertically, meaning they can’t move between any two holds that are more than 1 meter apart in any direction. Suppose also that the climbing wall is a 10-by-10 meter square. If the organizers again place the holds randomly, how many have to be placed on average until it’s possible to climb the wall? [Solution]

Question: The Robot Weightlifting World Championship’s final round is about to begin! Three robots, seeded 1, 2, and 3, remain in contention. They take turns from the 3rd seed to the 1st seed publicly declaring exactly how much weight (any nonnegative real number) they will attempt to lift, and no robot can choose exactly the same amount as a previous robot. Once the three weights have been announced, the robots attempt their lifts, and the robot that successfully lifts the most weight is the winner. If all robots fail, they just repeat the same lift amounts until at least one succeeds. Assume the following: all the robots have the same probability $p(w)$ of successfully lifting a given weight $w$; $p(w)$ is exactly known by all competitors, continuous, strictly decreasing as the w increases, $p(0) = 1,$ and $p(w) \rightarrow 0$ as $w \rightarrow \infty$; and all competitors want to maximize their chance of winning the RWWC. If $w$ is the amount of weight the 3rd seed should request, find $p(w).$ Give your answer to an accuracy of six decimal places. [Solution]

Question: Players A, B, C, and D are playing a game which starts with A saying the number $1.$ From that point on, each player says a number between $1$ and $4$ greater than the number spoken by the preceding player. The player who says $20$ wins the round, the player after them is removed from the game, the player after them starts the next round. Any other players survive to the next round. Each player’s top aim is to win the whole game but, if they realize that’s impossible, they’ll prioritize surviving to the next round. Who will survive the $4$ players game? [Solution]

Question: it’s the end of a close game of cornhole, and your team is $3$ points away from the win. By house rules, you have to hit the $3$ points exactly, or you lose. On your team are three athletes. The first is The Aggressor who has a $40%$ chance to get the cornhole, a $30%$ chance to hit the board and a $30%$ chance to miss entirely. The second is The Conservative who has a $10%$ chance to get the cornhole, a whopping $80%$ chance to hit the board, and a $10%$ chance to miss entirely. Finally, there’s The Waste who’s blind drunk at every game and will always miss the board. Given your roster and the free choice to use any of them in any situation, and you play optimally, what is the chance that you win the game? [Solution]

Question: it’s election night and your candidate is behind in the count. However, a significant fraction of the vote is still out in uncounted mail-in ballots. What are the chances that your candidates come back for the stunning victory if a whole bunch of people vote? What happens when the polls are tilted in one direction? [Solution]

Question: you’re watching the Moon from your room, alone, like every night. Seeking a higher purpose, you decide to track the projected area of the illuminated portion of the Moon throughout the month. If your data is accurate, how much faster will the illuminated Moon’s area be growing at half Moon as compared to a crescent Moon of $1/6^\text{th}$ area? [Solution]

Question: You’re playing a game of three on three basketball in a weird league. The rule on foul shots on a three pointer is that all three players from the team get to take turns shooting three foul shots. However, to get the second foul shot the team must make the first, and to get the second foul shot the team must make the second. As soon as a player misses, the foul shooting is over. If the players on your team have foul shot percentages $a,$ $b,$ and $c$ (no two equal), then what is the maximum number of shooting orders that would produce the same expected number of points? [Solution]

Question: in one of the great numerological miracles of our time, baseball players are obtaining batting averages with the same first three significant digits as the number of games in the stretch that the batting statistics are taken over. Is this an effect of rare planetary alignment? Suppose that a baseball player gets $4$ at bats in every of the $N$ games they play. What is the greatest value of $N$ for which it is impossible for the digits of their batting average (rounded to the nearest thousandth) to equal the number of games they’ve played in. [Solution]

Question: a regular staircase is built from blocks and the blocks in each level are different colors. The staircase can be built in whatever order that’s physically possible. However, whenever you make a choice, the Universal wave function splits so that each staircase actually exists in its own branch of the multiverse. In addition, the surface the stairs are built on is slightly sloped (in all verses), so any placed block slides forward until it hits the wall. How many universes will spawn to accommodate the possibilities for the $4$-level staircase? An $n$-level staircase? [Solution]