Difference between revisions of "1997 JBMO Problems"
m |
|||
Line 19: | Line 19: | ||
Let <math>n_1</math>, <math>n_2</math>, <math>\ldots</math>, <math>n_{1998}</math> be positive integers such that <cmath> n_1^2 + n_2^2 + \cdots + n_{1997}^2 = n_{1998}^2. </cmath> Show that at least two of the numbers are even. | Let <math>n_1</math>, <math>n_2</math>, <math>\ldots</math>, <math>n_{1998}</math> be positive integers such that <cmath> n_1^2 + n_2^2 + \cdots + n_{1997}^2 = n_{1998}^2. </cmath> Show that at least two of the numbers are even. | ||
+ | |||
+ | ==See also== | ||
+ | {{JBMO box|year=1997|before=First Olympiad|after=[[1998 JBMO Problems]]}} |
Revision as of 18:25, 15 September 2017
Problem 1
(Bulgaria) Show that given any 9 points inside a square of side length 1 we can always find 3 that form a triangle with area less than
Problem 2
(Cyprus) Let . Compute the following expression in terms of
:
Problem 3
(Greece) Let be a triangle and let
be the incenter. Let
,
be the midpoints of the sides
and
respectively. The lines
and
meet
at
and
respectively. Prove that
.
Problem 4
(Romania) Determine the triangle with sides and circumradius
for which
.
Problem 5
Let ,
,
,
be positive integers such that
Show that at least two of the numbers are even.
See also
1997 JBMO (Problems • Resources) | ||
Preceded by First Olympiad |
Followed by 1998 JBMO Problems | |
1 • 2 • 3 • 4 • 5 | ||
All JBMO Problems and Solutions |