Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2014 EGMO Problems"

(→‎Day 1)
(→‎Problem 5)
 
(One intermediate revision by the same user not shown)
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>.
  
−
[[2013 EGMO Problems/Problem 4|Solution]]
+
[[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.
  
−
Prove that <math>\angle ACP = \angle QCB</math>.
+
[[2014 EGMO Problems/Problem 5|Solution]]
−
 
 
−
[[2013 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>.
  
−
[[2013 EGMO Problems/Problem 6|Solution]]
+
[[2014 EGMO Problems/Problem 6|Solution]]

Latest revision as of 13:12, 24 December 2022

Day 1

Problem 1

Determine all real constants $t$ such that whenever $a$, $b$ and $c$ are the lengths of sides of a triangle, then so are $a^2+bct$, $b^2+cat$, $c^2+abt$.

Solution

Problem 2

Let $D$ and $E$ be points in the interiors of sides $AB$ and $AC$, respectively, of a triangle $ABC$, such that $DB = BC = CE$. Let the lines $CD$ and $BE$ meet at $F$. Prove that the incentre $I$ of triangle $ABC$, the orthocentre $H$ of triangle $DEF$ and the midpoint $M$ of the arc $BAC$ of the circumcircle of triangle $ABC$ are collinear.

Solution

Problem 3

We denote the number of positive divisors of a positive integer $m$ by $d(m)$ and the number of distinct prime divisors of $m$ by $\omega(m)$. Let $k$ be a positive integer. Prove that there exist infinitely many positive integers $n$ such that $\omega(n) = k$ and $d(n)$ does not divide $d(a^2+b^2)$ for any positive integers $a, b$ satisfying $a + b = n$.

Solution

Day 2

Problem 4

Determine all positive integers $n\geq 2$ for which there exist integers $x_1,x_2,\ldots ,x_{n-1}$ satisfying the condition that if $0<i<n,0<j<n, i\neq j$ and $n$ divides $2i+j$, then $x_i<x_j$.

Solution

Problem 5

Let $n$ be a positive integer. We have $n$ 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.

Solution

Problem 6

Determine all functions $f:\mathbb R\rightarrow\mathbb R$ satisfying the condition \[f(y^2+2xf(y)+f(x)^2)=(y+f(x))(x+f(y))\] for all real numbers $x$ and $y$.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2014_EGMO_Problems&oldid=184652"