Card game: who received r counters in last round?

Three players , and play the following game. On each of three cards an integer is written. These three numbers , , satisfy . The three cards are shuffled and one is dealt to each player. Each then receives the number of counters indicated by the card. Then the cards are shuffled again; the counters remaining with the players.

This process (shuffling, dealing, giving out counters) takes place for at least two rounds. After the last round has 20 counters in all, has 10 and has 9. At the last round received counters. Who received counters on the first round?

Topic: Teoria dei Numeri, Logica Metodo: Casework, Invarianti Abilita: Lettura attenta, Casework accurato, Ragionamento geometrico Area: Aritmetica e Teoria dei Numeri, Combinatoria, Logica e Probabilita Fonte: apri PDF p.1

Card game: who received r counters in last round?

Three players , and play the following game. On each of three cards an integer is written. These three numbers , , satisfy . The three cards are shuffled and one is dealt to each player. Each then receives the number of counters indicated by the card. Then the cards are shuffled again; the counters remaining with the players.

This process (shuffling, dealing, giving out counters) takes place for at least two rounds. After the last round has 20 counters in all, has 10 and has 9. At the last round received counters. Who received counters on the first round?

src_imho_1974__Q01

Geometric mean condition via sine inequality in triangle ABC

In the triangle , prove that there is a point on side such that is the geometric mean of and if and only if

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

Geometric mean condition by sine inequality in triangle ABC

In the triangle, prove that there is a point on side such that is the geometric mean of and if and only if

src_imho_1974__Q02

Sum involving binomial coefficients not divisible by 5

Prove that the number is not divisible by 5 for any integer .

Topic: Teoria dei Numeri, Combinatoria Metodo: Induzione, Congruenze Abilita: Manipolazione algebrica, Riconoscimento di pattern Area: Aritmetica e Teoria dei Numeri, Combinatoria, Logica e Probabilita Fonte: apri PDF p.1

Sum involving binomial coefficients not divisible by 5

Prove that the number is not divisible by 5 for any integer .

src_imho_1974__Q03

Chessboard decomposition into rectangles, maximum white squares

Consider decompositions of an chessboard into non-overlapping rectangles subject to the following conditions: (i) Each rectangle has as many white squares as black squares. (ii) If is the number of white squares in the -th rectangle, then . Find the maximum value of for which such a decomposition is possible. For this value of , determine all possible sequences .

Topic: Combinatoria Metodo: Casework, Estremalità, Conteggio Abilita: Conteggio sistematico, Casework accurato, Modellizzazione Area: Combinatoria, Logica e Probabilita Fonte: apri PDF p.1

Chessboard decomposition into rectangles, maximum white squares

Consider decompositions of an chessboard into non-overlapping rectangles subject to the following conditions: (i) Each rectangle has as many white squares as black squares. If is the number of white squares in the -th rectangle, then . Find the maximum value of for which such a decomposition is possible. For this value of , determine all possible sequences .

src_imho_1974__Q04

Find all possible values of a cyclic sum of four fractions

Determine all possible values of where are arbitrary positive numbers.

Topic: Algebra, Disuguaglianze Metodo: Disuguaglianze, Estremalità Abilita: Manipolazione algebrica, Stima, Riconoscimento di pattern Area: Algebra e Analisi Fonte: apri PDF p.1

Find all possible values of a cyclic sum of four fractions

Determine all possible values of where are arbitrary positive numbers.

src_imho_1974__Q05

Bound on integers where polynomial squares equal 1

Let be a non-constant polynomial with integer coefficients. If is the number of distinct integers such that , prove that , where denotes the degree of the polynomial .

Topic: Algebra, Teoria dei Numeri Metodo: Fattorizzazione, Congruenze Abilita: Manipolazione algebrica, Ragionamento geometrico, Astrazione Area: Algebra e Analisi, Aritmetica e Teoria dei Numeri Fonte: apri PDF p.1

Bound on integers where polynomial squares equal 1

Let be a non-constant polynomial with integer coefficients. If is the number of distinct integers such that , prove that , where denotes the degree of the polynomial .

src_imho_1974__Q06