When is a triangle like a circle?

This week’s Fiddler is about a generalized notion of “radius”.

For a circle with radius $r$, its area is $\pi r^2$ and its circumference is $2\pi r$. If you take the derivative of the area formula with respect to $r$, you get the circumference formula! Let’s define the term “differential radius.” The differential radius $r$ of a shape with area $A$ and perimeter $P$ (both functions of $r$) has the property that $dA/dr = P$. (Note that $A$ always scales with $r^2$ and $P$ always scales with $r$.)

For example, consider a square with side length $s$. Its differential radius is $r = s/2$. The square’s area is $s^2$, or $4r^2$, and its perimeter is $4s$, or $8r$. Sure enough, $dA/dr = d(4r^2)/dr = 8r = P$. What is the differential radius of an equilateral triangle with side length s?

Extra credit:
What is the differential radius of a rectangle with sides of length $a$ and $b$?

My solution:
[Show Solution]

Tiling squares

This week’s Fiddler is about tiling a square with smaller squares.

Suppose you have infinitely many 3-by-3 cm tiles and infinitely many 5-by-5 cm tiles. You want to use some of these tiles to precisely cover a square whose side length is a whole number of centimeters. Tiles may not overlap, and they must completely cover the larger square, without jutting beyond its borders. What is the smallest side length this larger square can have, such that it can be precisely covered using at least one 3-by-3 tile and at least one 5-by-5 tile?

Extra credit:
This time, you have an infinite supply of square tiles for each odd whole number side length (as measured in centimeters) greater than 1 cm. In other words, you have infinitely many 3-by-3 cm tiles, infinitely many 5-by-5 cm tiles, infinitely many 7-by-7 cm tiles, and so on. You want to use one or more of these tiles to precisely cover a square whose side length is $N$ cm, where $N$ is an integer. Once again, tiles may not overlap, and they must completely cover the larger square without jutting beyond its borders. What is the largest integer N for which this task is not possible?

My solution:
[Show Solution]

Showcase Showdown

This week’s Fiddler is based on “Showcase Showdown” on the game show “The Price is Right”.

Suppose we have some number of players. Player A is the first to spin a giant wheel, which spits out a real number chosen randomly and uniformly between 0 and 1. All spins are independent of each other. After spinning, A can either stick with the number they just got or spin the wheel one more time. If they spin again, their assigned number is the sum of the two spins, as long as that sum is less than or equal to 1. If the sum exceeds 1, A is immediately declared a loser.

After A is done spinning (whether once or twice), B steps up to the wheel. Like A, they can choose to spin once or twice. If they spin twice and the sum exceeds 1, they are similarly declared the loser. This continues until all players are done. Whoever has the greater value (that does not exceed 1) is declared the winner.

Assuming all players play the game optimally, what are player A’s chances of winning?

My solution:
[Show Solution]