Maths Olympiad Prep

Library / Junior Balkan Mathematical Olympiad /80 of 95

Junior Balkan Mathematical Olympiad

Combinatorics Difficulty 6.6 National Olympiad Prove it JBMO

Problem:

given an m×nm \times n table, each cell signed with "-". The following operations are
(i) to change all the signs in an entire row to the opposite, i.e. every "-" to "+", and every "+" to "-";
(ii) to change all the signs in an entire column to the opposite, i.e. every "-" to "+" and every "+" to "-".

a. Prove that if m=n=100m = n = 100, using the above operations one cannot obtain 2004 signs "+".

b. If m=100m = 100, find the least n>100n > 100 for which 2004 signs "+" can be obtained.

Solution

Solution:

If we apply (i) to ll rows and (ii) to kk columns, we obtain (m−k)l+(n−l)k(m-k)l + (n-l)k plus signs.

a.
We have the equation (100−k)l+(100−l)k=2004(100-k)l + (100-l)k = 2004, or 100l+100k−2lk=2004100l + 100k - 2lk = 2004.

50l+50k−lk=1002 50l + 50k - lk = 1002
Rewrite the last equation as
(50−l)(50−k)=2500−1002=1498 (50-l)(50-k) = 2500 - 1002 = 1498
Since 1498=2⋅7⋅1071498 = 2 \cdot 7 \cdot 107, this equation has no solutions in natural numbers.

b.
Let n=101n = 101. Then we have
(100−k)l+(101−l)k=2004 (100-k)l + (101-l)k = 2004
Or
100l+101k−2lk=2004 100l + 101k - 2lk = 2004
That is,
101k=2004−100l+2lk 101k = 2004 - 100l + 2lk
Or
101k−2lk=2004−100l 101k - 2lk = 2004 - 100l
k(101−2l)=2004−100l k(101 - 2l) = 2004 - 100l
So
k=2004−100l101−2l k = \frac{2004 - 100l}{101 - 2l}
Since kk must be a natural number, check possible ll values. For l=4l = 4:
k=2004−400101−8=160493≈17.25 k = \frac{2004 - 400}{101 - 8} = \frac{1604}{93} \approx 17.25
Not integer. For l=5l = 5:
k=2004−500101−10=150491≈16.53 k = \frac{2004 - 500}{101 - 10} = \frac{1504}{91} \approx 16.53
Not integer. Continue checking, but no integer solution for n=101n = 101.

Let n=102n = 102. Then we have
(100−k)l+(102−l)k=2004 (100-k)l + (102-l)k = 2004
Or
100l+102k−2lk=2004 100l + 102k - 2lk = 2004
50l+51k−lk=1002 50l + 51k - lk = 1002
Rewrite the last equation as
(51−l)(50−k)=2550−1002=1548 (51-l)(50-k) = 2550 - 1002 = 1548
Since 1548=2⋅2⋅3⋅3⋅431548 = 2 \cdot 2 \cdot 3 \cdot 3 \cdot 43, try 51−l=3651 - l = 36 and 50−k=4350 - k = 43. Then l=15l = 15, k=7k = 7.

Indeed,
(100−7)⋅15+(102−15)⋅7=93⋅15+87⋅7=1395+609=2004 (100 - 7) \cdot 15 + (102 - 15) \cdot 7 = 93 \cdot 15 + 87 \cdot 7 = 1395 + 609 = 2004
Hence, the least nn is 102102.

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

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