Maths Olympiad Prep

Library / /48 of 75

Number theory Difficulty 5.3 AIME, harder Prove it Italy

Problem:

Determine the number of right rectangular parallelepipeds with a square base having all edges of integer length and volume equal to 270000270000.

Solution

Solution:

Let xx be the side of the base and yy the height of a parallelepiped satisfying the given conditions. Then xx and yy are positive integers and
x2y=270000=332454. x^2 y = 270000 = 3^3 \cdot 2^4 \cdot 5^4.
By the unique factorization of integers, we have x=3a2b5cx = 3^a 2^b 5^c, y=3d2e5fy = 3^d 2^e 5^f, where the exponents satisfy the following conditions:
2a+d=3,0a,d3, \begin{array}{ll} 2a + d = 3, & 0 \leq a, d \leq 3, \end{array}
Thus the only possible cases are:
(a,d)=(0,3), (1,1)(b,e)=(0,4), (1,2), (2,0)(c,f)=(0,4), (1,2), (2,0) \begin{array}{r} (a, d) = (0,3),\ (1,1) \\ (b, e) = (0,4),\ (1,2),\ (2,0) \\ (c, f) = (0,4),\ (1,2),\ (2,0) \end{array}
Combining in all possible ways the two possibilities for (a,d)(a, d), the three possibilities for (b,e)(b, e), and the three possibilities for (c,f)(c, f), we obtain 233=182 \cdot 3 \cdot 3 = 18 parallelepipeds.

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 translated into English from it; metadata (topic, difficulty) added by this project.