Maths Olympiad Prep

Library / /1382 of 1394

, 2024

Algebra Difficulty 6.3 National Olympiad Prove it United States

Problem:

Suppose aa and bb are positive integers. Isabella and Vidur both fill up an a×ba \times b table. Isabella fills it up with numbers 1,2,,ab1,2, \ldots, a b, putting the numbers 1,2,,b1,2, \ldots, b in the first row, b+1,b+2,,2bb+1, b+2, \ldots, 2 b in the second row, and so on. Vidur fills it up like a multiplication table, putting iji j in the cell in row ii and column jj. (Examples are shown for a 3×43 \times 4 table below.)

1234
5678
9101112

Isabella's Grid
1234
2468
36912

Vidur's Grid

Isabella sums up the numbers in her grid, and Vidur sums up the numbers in his grid; the difference between these two quantities is 1200. Compute a+ba+b.

Solution

Solution:

Using the formula 1+2++n=n(n+1)21+2+\cdots+n=\frac{n(n+1)}{2}, we get

ab(ab+1)2a(a+1)2b(b+1)2=ab(2(ab+1)(a+1)(b+1))4=ab(abab+1)4=ab(a1)(b1)4=a(a1)2b(b1)2 \begin{aligned} \frac{a b(a b+1)}{2}-\frac{a(a+1)}{2} \cdot \frac{b(b+1)}{2} & =\frac{a b(2(a b+1)-(a+1)(b+1))}{4} \\ & =\frac{a b(a b-a-b+1)}{4} \\ & =\frac{a b(a-1)(b-1)}{4} \\ & =\frac{a(a-1)}{2} \cdot \frac{b(b-1)}{2} \end{aligned}

This means we can write the desired equation as

a(a1)b(b1)=4800 a(a-1) \cdot b(b-1)=4800

Assume bab \leq a, so we know b(b1)a(a1)b(b-1) \leq a(a-1), so b(b1)<70b(b-1)<70. Thus, b8b \leq 8.
If b=7b=7 or b=8b=8, then b(b1)b(b-1) has a factor of 7, which 4800 does not, so b6b \leq 6.
If b=6b=6 then b(b1)=30b(b-1)=30, so a(a1)=160a(a-1)=160, which can be seen to have no solutions.
If b=5b=5 then b(b1)=20b(b-1)=20, so a(a1)=240a(a-1)=240, which has the solution a=16a=16, giving 5+16=215+16=21.
We need not continue since we are guaranteed only one solution, but we check the remaining cases for completeness. If b=4b=4 then a(a1)=480012=400a(a-1)=\frac{4800}{12}=400, which has no solutions. If b=3b=3 then a(a1)=48006=800a(a-1)=\frac{4800}{6}=800 which has no solutions. Finally, if b=2b=2 then a(a1)=48002=2400a(a-1)=\frac{4800}{2}=2400, which has no solutions.

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.