Difference between revisions of "2014 EGMO Problems"
(→Problem 3) |
(→Problem 5) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 3: | Line 3: | ||
Determine all real constants <math>t</math> such that whenever <math>a</math>, <math>b</math> and <math>c</math> are the lengths of sides of a triangle, then so are <math>a^2+bct</math>, <math>b^2+cat</math>, <math>c^2+abt</math>. | Determine all real constants <math>t</math> such that whenever <math>a</math>, <math>b</math> and <math>c</math> are the lengths of sides of a triangle, then so are <math>a^2+bct</math>, <math>b^2+cat</math>, <math>c^2+abt</math>. | ||
− | [[ | + | [[2014 EGMO Problems/Problem 1|Solution]] |
===Problem 2=== | ===Problem 2=== | ||
Let <math>D</math> and <math>E</math> be points in the interiors of sides <math>AB</math> and <math>AC</math>, respectively, of a triangle <math>ABC</math>, such that <math>DB = BC = CE</math>. Let the lines <math>CD</math> and <math>BE</math> meet at <math>F</math>. Prove that the incentre <math>I</math> of triangle <math>ABC</math>, the orthocentre <math>H</math> of triangle <math>DEF</math> and the midpoint <math>M</math> of the arc <math>BAC</math> of the circumcircle of triangle <math>ABC</math> are collinear. | Let <math>D</math> and <math>E</math> be points in the interiors of sides <math>AB</math> and <math>AC</math>, respectively, of a triangle <math>ABC</math>, such that <math>DB = BC = CE</math>. Let the lines <math>CD</math> and <math>BE</math> meet at <math>F</math>. Prove that the incentre <math>I</math> of triangle <math>ABC</math>, the orthocentre <math>H</math> of triangle <math>DEF</math> and the midpoint <math>M</math> of the arc <math>BAC</math> of the circumcircle of triangle <math>ABC</math> are collinear. | ||
− | [[ | + | [[2014 EGMO Problems/Problem 2|Solution]] |
===Problem 3=== | ===Problem 3=== | ||
We denote the number of positive divisors of a positive integer <math>m</math> by <math>d(m)</math> and the number of distinct prime divisors of <math>m</math> by <math>\omega(m)</math>. Let <math>k</math> be a positive integer. Prove that there exist infinitely many positive integers <math>n</math> such that <math>\omega(n) = k</math> and <math>d(n)</math> does not divide <math>d(a^2+b^2)</math> for any positive integers <math>a, b</math> satisfying <math>a + b = n</math>. | We denote the number of positive divisors of a positive integer <math>m</math> by <math>d(m)</math> and the number of distinct prime divisors of <math>m</math> by <math>\omega(m)</math>. Let <math>k</math> be a positive integer. Prove that there exist infinitely many positive integers <math>n</math> such that <math>\omega(n) = k</math> and <math>d(n)</math> does not divide <math>d(a^2+b^2)</math> for any positive integers <math>a, b</math> satisfying <math>a + b = n</math>. | ||
− | [[ | + | [[2014 EGMO Problems/Problem 3|Solution]] |
==Day 2== | ==Day 2== | ||
Line 19: | Line 19: | ||
Determine all positive integers <math>n\geq 2</math> for which there exist integers <math>x_1,x_2,\ldots ,x_{n-1}</math> satisfying the condition that if <math>0<i<n,0<j<n, i\neq j</math> and <math>n</math> divides <math>2i+j</math>, then <math>x_i<x_j</math>. | Determine all positive integers <math>n\geq 2</math> for which there exist integers <math>x_1,x_2,\ldots ,x_{n-1}</math> satisfying the condition that if <math>0<i<n,0<j<n, i\neq j</math> and <math>n</math> divides <math>2i+j</math>, then <math>x_i<x_j</math>. | ||
− | [[ | + | [[2014 EGMO Problems/Problem 4|Solution]] |
===Problem 5=== | ===Problem 5=== | ||
Let <math>n</math> be a positive integer. We have <math>n</math> boxes where each box contains a non-negative number of pebbles. In each move we are allowed to take two pebbles from a box we choose, throw away one of the pebbles and put the other pebble in another box we choose. An initial configuration of pebbles is called solvable if it is possible to reach a configuration with no empty box, in a finite (possibly zero) number of moves. Determine all initial configurations of pebbles which are not solvable, but become solvable when an additional pebble is added to a box, no matter which box is chosen. | Let <math>n</math> be a positive integer. We have <math>n</math> boxes where each box contains a non-negative number of pebbles. In each move we are allowed to take two pebbles from a box we choose, throw away one of the pebbles and put the other pebble in another box we choose. An initial configuration of pebbles is called solvable if it is possible to reach a configuration with no empty box, in a finite (possibly zero) number of moves. Determine all initial configurations of pebbles which are not solvable, but become solvable when an additional pebble is added to a box, no matter which box is chosen. | ||
− | + | [[2014 EGMO Problems/Problem 5|Solution]] | |
− | |||
− | [[ | ||
===Problem 6=== | ===Problem 6=== | ||
Line 33: | Line 31: | ||
for all real numbers <math>x</math> and <math>y</math>. | for all real numbers <math>x</math> and <math>y</math>. | ||
− | [[ | + | [[2014 EGMO Problems/Problem 6|Solution]] |
Latest revision as of 13:12, 24 December 2022
Contents
Day 1
Problem 1
Determine all real constants such that whenever , and are the lengths of sides of a triangle, then so are , , .
Problem 2
Let and be points in the interiors of sides and , respectively, of a triangle , such that . Let the lines and meet at . Prove that the incentre of triangle , the orthocentre of triangle and the midpoint of the arc of the circumcircle of triangle are collinear.
Problem 3
We denote the number of positive divisors of a positive integer by and the number of distinct prime divisors of by . Let be a positive integer. Prove that there exist infinitely many positive integers such that and does not divide for any positive integers satisfying .
Day 2
Problem 4
Determine all positive integers for which there exist integers satisfying the condition that if and divides , then .
Problem 5
Let be a positive integer. We have boxes where each box contains a non-negative number of pebbles. In each move we are allowed to take two pebbles from a box we choose, throw away one of the pebbles and put the other pebble in another box we choose. An initial configuration of pebbles is called solvable if it is possible to reach a configuration with no empty box, in a finite (possibly zero) number of moves. Determine all initial configurations of pebbles which are not solvable, but become solvable when an additional pebble is added to a box, no matter which box is chosen.
Problem 6
Determine all functions satisfying the condition for all real numbers and .