Maths Olympiad Prep

Library / /556 of 740

, 2018

Geometry Difficulty 5.2 AIME, harder Prove it United States

Problem:

Real numbers xx, yy, and zz are chosen from the interval [1,1][-1,1] independently and uniformly at random. What is the probability that

x+y+z+x+y+z=x+y+y+z+z+x? |x|+|y|+|z|+|x+y+z|=|x+y|+|y+z|+|z+x| ?

Solution

Solution:

We assume that xx, yy, zz are all nonzero, since the other case contributes zero to the total probability.

If xx, yy, zz are all positive or all negative then the equation is obviously true. Otherwise, since flipping the signs of all three variables or permuting them does not change the equality, we assume WLOG that x,y>0x, y > 0 and z<0z < 0.

If x+y+z>0x+y+z > 0, then the LHS of the original equation becomes x+yz+x+y=z=2x+2yx + y - z + x + y = z = 2x + 2y, and the RHS becomes x+y+x+z+y+zx + y + |x+z| + |y+z|, so we need x+z+y+z=x+y|x+z| + |y+z| = x + y. But this is impossible when xy<z<0-x-y < z < 0, since the equality is achieved only at the endpoints and all the values in between make the LHS smaller than the RHS. (This can be verified via simple casework.)

If x+y+z<0x+y+z < 0, then x+z,y+z<0x+z, y+z < 0 as well, so the LHS of the original equation becomes x+yzxyz=2zx + y - z - x - y - z = -2z and the RHS becomes x+yxzyz=2zx + y - x - z - y - z = -2z. In this case, the equality holds true.

Thus, we seek the volume of all points (x,y,z)[0,1]3(x, y, z) \in [0,1]^3 that satisfy x+yz<0x + y - z < 0 (we flip the sign of zz here for convenience). The equation x+yz=0x + y - z = 0 represents a plane through the vertices (1,0,1)(1,0,1), (0,0,0)(0,0,0), (0,1,1)(0,1,1), and the desired region is the triangular pyramid, above the plane inside the unit cube, which has vertices (1,0,1)(1,0,1), (0,0,0)(0,0,0), (0,1,1)(0,1,1), (0,0,1)(0,0,1). This pyramid has volume 16\frac{1}{6}.

So the total volume of all points in [1,1]3[-1,1]^3 that satisfy the equation is 21+616=32 \cdot 1 + 6 \cdot \frac{1}{6} = 3, out of 23=82^3 = 8, so the probability is 38\frac{3}{8}.

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.