Inequality for real sequences with defined differences

Real numbers are given. For each () define and let (a) Prove that, for any real numbers , \max\{|x_i - a_i| : 1 \le i \le n\} \ge \frac{d}{2}. \tag{*} (b) Show that there are real numbers such that equality holds in .

Topic: Algebra, Disuguaglianze Metodo: Estremalità, Casework Abilita: Manipolazione algebrica, Lettura attenta, Stima Area: Algebra e Analisi Fonte: apri PDF p.1

Inequality for real sequences with defined differences

Real numbers are given. For each () define and let (a) Prove that, for any real numbers , \max\{|x_i - a_i| : 1 \le i \le n\} \ge \frac{d}{2}. \tag{*} (b) Show that there are real numbers such that equality holds in .

src_imho_2007__Q01

Line through vertex of parallelogram meets cyclic quadrilateral

Consider five points , , , and such that is a parallelogram and is a cyclic quadrilateral. Suppose that a line passing through intersects the interior of the segment at and intersects line at . Suppose also that . Prove that is the bisector of angle .

Topic: Geometria piana Metodo: Trigonometria, Coordinate Abilita: Ragionamento geometrico, Manipolazione algebrica Area: Geometria Fonte: apri PDF p.1

Line through vertex of parallelogram meets cyclic quadrilateral

Consider five points , , , and such that is a parallelogram and is a cyclic quadrilateral. Suppose that a line passing through intersects the interior of the segment at and intersects line at . Suppose also that . Prove that is the bisector of angle .

src_imho_2007__Q02

Clique sizes in two-room partition of friendship graph

In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a clique if each two of them are friends. (In particular, any group of fewer than two competitors is a clique.) The number of members of a clique is called its size.

Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged in two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room.

Topic: Combinatoria Metodo: Grafi, Estremalità, Casework Abilita: Ragionamento geometrico, Modellizzazione, Astrazione, Casework accurato Area: Combinatoria, Logica e Probabilita Fonte: apri PDF p.1

Click sizes in two-room partition of friendship graph

In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a clique if each of them are friends. The number of members of a clique is called its size.

Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged in two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room.

src_imho_2007__Q03

Angle bisector, circumcircle, perpendicular bisectors, equal areas

In triangle the bisector of angle intersects the circumcircle again at , the perpendicular bisector of at , and the perpendicular bisector of at . The midpoint of is and the midpoint of is . Prove that the triangles and have the same area.

Topic: Geometria piana Metodo: Trigonometria, Coordinate Abilita: Ragionamento geometrico, Manipolazione algebrica Area: Geometria Fonte: apri PDF p.1

Angle bisector, circumcircle, perpendicular bisectors, equal areas

In triangle the bisector of angle intersects the circumcircle again at , the perpendicular bisector of at , and the perpendicular bisector of at . The midpoint of is and the midpoint of is . Prove that the and triangles have the same area.

src_imho_2007__Q04

Divisibility condition forces a equals b

Let and be positive integers. Show that if divides , then .

Topic: Teoria dei Numeri Metodo: Congruenze, Fattorizzazione, Estremalità, Induzione Abilita: Manipolazione algebrica, Riconoscimento di pattern, Lettura attenta Area: Aritmetica e Teoria dei Numeri Fonte: apri PDF p.1

Divisibility condition forces at equals b

Let and be positive integers. Show that if divides , then .

src_imho_2007__Q05

Minimum planes covering lattice points with positive coordinate sum

Let be a positive integer. Consider as a set of points in three-dimensional space. Determine the smallest possible number of planes, the union of which contains but does not include .

Topic: Combinatoria, Geometria solida Metodo: Estremalità, Induzione, Doppio conteggio Abilita: Astrazione, Modellizzazione, Conteggio sistematico, Stima Area: Combinatoria, Logica e Probabilita, Geometria Fonte: apri PDF p.1

Minimum planes covering lattice points with positive coordinate sum

Let be a positive integer. Consider as a set of points in three-dimensional space. Determine the smallest possible number of planes, the union of which contains but does not include .

src_imho_2007__Q06