Maths Olympiad Prep

Library / /704 of 740

, 2019

Combinatorics Difficulty 5.7 AIME, harder Prove it United States

Problem:

For dessert, Melinda eats a spherical scoop of ice cream with diameter 22 inches. She prefers to eat her ice cream in cube-like shapes, however. She has a special machine which, given a sphere placed in space, cuts it through the planes x=nx=n, y=ny=n, and z=nz=n for every integer nn (not necessarily positive). Melinda centers the scoop of ice cream uniformly at random inside the cube 0x,y,z10 \leq x, y, z \leq 1, and then cuts it into pieces using her machine. What is the expected number of pieces she cuts the ice cream into?

Solutions — 2

Solution 1

Solution:

Note that if we consider the division of R3\mathbb{R}^3 into unit cubes by the given planes, we only need to compute the sum of the probabilities that the ice cream scoop intersects each cube. There are three types of cubes that can be intersected:

- The cube 0x,y,z10 \leq x, y, z \leq 1 in which the center lies, as well as the 6 face-adjacent cubes are always intersected, for a total of 77.

- The cubes edge-adjacent to the center cube are intersected if the center of the ice cream lies within 11 unit of the connecting edge, which happens with probability π4\frac{\pi}{4}. There are 1212 such cubes, for a total of 3π3\pi.

- The cubes corner-adjacent to the center cube are intersected if the center of the ice cream lies within 11 unit of the connecting corner, which happens with probability π6\frac{\pi}{6}. There are 88 such cubes, for a total of 4π3\frac{4\pi}{3}.

Adding these all up gives our answer of 7+13π37+\frac{13\pi}{3}.

Solution 2

Solution:

We compute the number of regions into which a convex region SS in R3\mathbb{R}^3 is divided by planes: Let aa be the number of planes intersecting SS. Let bb be the number of lines (intersections of two planes) passing through SS. Let cc be the number of points (intersections of three planes) lying inside SS. Then SS is divided into a+b+c+1a+b+c+1 regions. Then the computation for the problem is fairly straightforward. Note that the only planes, lines, and points that can intersect the ice cream scoop II are the faces, edges, and vertices of the cube 0x,y,z10 \leq x, y, z \leq 1. The computation is essentially the same as in the first solution. The scoop intersects each of the 66 faces with probability 11, each of the 1212 edges with probability π4\frac{\pi}{4}, and each of the 88 vertices with probability π6\frac{\pi}{6}, for a total expected number of regions 1+6+3π+4π3=7+13π31+6+3\pi+\frac{4\pi}{3}=7+\frac{13\pi}{3}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.