problem solving journal all over the world; visit http://journals.cms.math.

ca/CRUX/
(An asterisk (⋆ ) after a number indicates that a problem was proposed without a solution.)
2. Proposed by L´eo Sauv´e, Algonquin College.
A rectangular array of m rows and n columns contains mn distinct real numbers. For i =
1, 2, . . . ,m, let si denote the smallest number of the ith row; and for j = 1, 2, . . . , n, let lj denote
the largest number of the jth column. Let A = max{si} and B = min{lj}. Compare A and B.
14. Proposed by Viktors Linis, University of Ottawa.
If a, b, c are lengths of three segments which can form a triangle, show the same for 1
a+c , 1
b+c ,
1
a+b .

17. Proposed by Viktors Linis, University of Ottawa.

Prove the inequality
1
2・
3
4・
5
6・・・
999999
1000000
<
1
1000
.
23. Proposed by L´eo Sauv´e, Coll`ege Algonquin.
D´eterminer s’il existe une suite {un} d’entiers naturels telle que, pour n = 1, 2, 3, . . ., on ait
2un < 2n + 1 < 21+un
25. Proposed by Viktors Linis, University of Ottawa.
Find the smallest positive value of 36k − 5l where k and l are positive integers.
29. Proposed by Viktors Linis, University of Ottawa.
Cut a square into a minimal number of triangles with all angles