Difference between revisions of "1997 IMO Problems/Problem 4"
(Created page with "==Problem== An <math>n \times n</math> matrix whose entries come from the set <math>S={1,2,...,2n-1}</math> is called a <math>\textit{silver}</math> matrix if, for each <math...") |
(→Solution) |
||
| Line 9: | Line 9: | ||
==Solution== | ==Solution== | ||
{{solution}} | {{solution}} | ||
| + | |||
| + | ==See Also== | ||
| + | |||
| + | {{IMO box|year=1997|num-b=3|num-a=5}} | ||
| + | [[Category:Olympiad Geometry Problems]] | ||
| + | [[Category:3D Geometry Problems]] | ||
Latest revision as of 00:01, 17 November 2023
Problem
An 
matrix whose entries come from the set 
is called a 
matrix if, for each 
, the 
th row and the th column together contain all elements of 
. Show that
(a) there is no matrix for 
;
(b) matrices exist for infinitely many values of 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1997 IMO (Problems) • Resources | ||
| Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 5 |
| All IMO Problems and Solutions | ||
