Midpoints of segments in square form dodecagon vertices

Equilateral triangles , , , are constructed inside the square . Prove that the midpoints of the four segments , , , and the midpoints of the eight segments , , , , , , , are the twelve vertices of a regular dodecagon.

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

Midpoints of segments in square form dodecagon vertices

Equilateral triangles , , , are constructed inside the square . Prove that the midpoints of the four segments , , , and the midpoints of the eight segments , , , , , , are the twelve vertices of a regular dodecagon.

src_imho_1977__Q01

Finite sequence: max terms negative with seven successive sum negative

In a finite sequence of real numbers the sum of any seven successive terms is negative, and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.

Topic: Algebra, Combinatoria Metodo: Casework, Estremalità Abilita: Ragionamento geometrico, Manipolazione algebrica, Lettura attenta Area: Algebra e Analisi, Combinatoria, Logica e Probabilita Fonte: apri PDF p.1

Finite sequence: max terms negative with seven successive sum negative

In a finite sequence of real numbers the sum of any seven successive terms is negative, and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.

src_imho_1977__Q02

Indecomposable numbers in set ; prove

Let be a given integer , and let be the set of integers , where A number is called in if there do not exist numbers such that . Prove that there exists a number that can be expressed as the product of elements indecomposable in in more than one way. (Products which differ only in the order of their factors will be considered the same.)

Topic: Teoria dei Numeri Metodo: Congruenze, Fattorizzazione, Casework Abilita: Manipolazione algebrica, Riconoscimento di pattern, Astrazione Area: Aritmetica e Teoria dei Numeri Fonte: apri PDF p.1

Indecomposable numbers in set ; proofs

Let be a given integer , and let be the set of integers , where A number is called in if there do not exist numbers such that . Prove that there exists a number that can be expressed as the product of elements indecomposable in in more than one way. (Products which differ only in the order of their factors will be considered the same.)

src_imho_1977__Q03

Four real constants; prove implies

Four real constants , , , are given, and Prove that if for all real , then and .

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

Four real constants; proofs implies

Four real constants , , , are given, and Prove that if for all real , then and .

src_imho_1977__Q04

Pairs with divisible by ; remainder

Let and be positive integers. When is divided by , the quotient is and the remainder is . Prove that there are infinitely many pairs such that .

Topic: Teoria dei Numeri, Algebra Metodo: Congruenze, Induzione, Casework Abilita: Manipolazione algebrica, Riconoscimento di pattern, Conteggio sistematico Area: Aritmetica e Teoria dei Numeri, Algebra e Analisi Fonte: apri PDF p.1

Parts with divisible by ; remainder *

Let and be positive integers. When is divided by , the quotient is and the remainder is . Prove that there are infinitely many pairs such that .

src_imho_1977__Q05

Function on positive integers with ; prove

Let be a function defined on the set of all positive integers and having all its values in the same set. Prove that if for each positive integer , then for each positive integer .

Topic: Insiemi e funzioni, Algebra Metodo: Induzione, Invarianti, Estremalità Abilita: Astrazione, Manipolazione algebrica, Ragionamento geometrico Area: Algebra e Analisi Fonte: apri PDF p.1

Function on positive integers with ; proofs

Let be a function defined on the set of all positive integers and having all its values in the same set. Prove that if for each positive integer , then for each positive integer .

src_imho_1977__Q06