Knight-like moves of distance sqrt(r) across board corners
We are given a positive integer r and a rectangular board ABCD with dimensions |AB| = 20, |BC| = 12. The rectangle is divided into a grid of 20 × 12 unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is √r. The task is to find a sequence of moves leading from the square with A as a vertex to the square with B as a vertex. (a) Show that the task cannot be done if r is divisible by 2 or 3. (b) Prove that the task is possible when r = 73. (c) Can the task be done when r = 97?
Topic: Combinatoria, Teoria dei Numeri Metodo: parita, congruenze Area: Aritmetica e Teoria dei Numeri, Combinatoria, Logica e Probabilita Fonte: apri PDF p.1
Knight-like moves of distance sqrt(r) across board corners
We are given a positive integer r and a rectangular board ABCD with dimensions =AB = 20, The rectangle is divided into a grid of 20 × 12 unit squares. The following moves are allowed on the board: one can move from one square to another only if the distance between the centers of the two squares is √r. The task is to find a sequence of moves leading from the square with A as a vertex to the square with B as a vertex. (a) Show that the task cannot be done if r is divisible by 2 or 3. (b) Prove that the task is possible when r = 73. (c) Can the task be done when r = 97?
Show AP, BD, CE concurrent with incenter angle condition
Let P be a point inside triangle ABC such that ̸ APB −̸ ACB = ̸ APC −̸ ABC. Let D, E be the incenters of triangles APB, APC, respectively. Show that AP, BD, CE meet at a point.
Topic: Geometria piana Metodo: Sfruttamento della simmetria, Tecniche trigonometriche Abilita: Ragionamento geometrico Area: Geometria Fonte: apri PDF p.1
Show AP, BD, CE concurrent with incenter angle condition
Let P be a point inside triangle ABC such that APB − ACB = APC − ABC. Let D, E be the incenters of triangles APB, APC, respectively. Show that AP, BD, CE meet at a point.
Find all f with f(m+f(n))=f(f(m))+f(n)
Let S denote the set of nonnegative integers. Find all functions f from S to itself such that f(m + f(n)) = f(f(m)) + f(n) ∀m, n ∈S. 37th International Mathematical Olympiad Mumbai, India Day II 9 a.m. - 1:30 p.m. July 11, 1996
Topic: successioni Metodo: monovarianti Abilita: generalizzazione Area: Algebra e Analisi Fonte: apri PDF p.1
*Find all f with f(m+f(n))=f(f(m))+f(n) *
Let S denotes the set of nonnegative integers. Find all functions f from S to itself such that f(m + f(n)) = f(f(m)) + f(n) ∀m, n ∈S. 37th International Mathematical Olympiad Mumbai, India Day II at 9 am - 1:30 p.m. July 11, 1996
Least square value with 15a+16b and 16a-15b both squares
I numeri interi positivi e sono tali che i numeri e siano entrambi quadrati di numeri interi positivi. Qual è il minimo valore possibile che può assumere il minore di questi due quadrati?
Topic: Teoria dei Numeri Metodo: congruenze Area: Aritmetica e Teoria dei Numeri Fonte: apri PDF p.2
Least square value with 15a+16b and 16a-15b both squares
The positive integers and are such that the numbers and are both squares of positive integers. What’s the smallest possible value that the least of these two squares can take?
circumradii sum at least half perimeter
Sia un esagono convesso tale che è parallelo a , è parallelo a , e è parallelo a . Siano i raggi dei cerchi circoscritti ai triangoli , , , rispettivamente, e sia il perimetro dell’esagono. Dimostrare che
Topic: Geometria piana, Disuguaglianze Metodo: Disuguaglianze classiche Abilita: Ragionamento geometrico Area: Algebra e Analisi, Geometria Fonte: apri PDF p.2
circumradii sum at least half perimeter
If is a convex hexagon such that is parallel to , is parallel to , and is parallel to . The radii of the circles surrounding the triangles , , , respectively, and are the perimeter of the hexagon. Show that
Lattice-path tuple has two indices with equal values
Siano tre numeri interi positivi con . Sia una -upla di interi che soddisfa le seguenti condizioni:
(a) .
(b) Per ogni con , si ha oppure .
Dimostrare che esistono indici con , tali che .
Topic: Combinatoria Metodo: Principio dei cassetti Area: Combinatoria, Logica e Probabilita Fonte: apri PDF p.2
Lattice-path tuple has two indices with equal values
Three positive integers with are . Whether a -upple of integers that satisfies the following conditions:
(a) .
(b) For each with , or is given.
Demonstrate the existence of indexes with , such as .