olymmath

CIIM 2016

Iberoamerican Interuniversity Mathematics Competition 2016.

Day 1

Problem 1

  • Day 1

Find all functions f:(0,+∞)→(0,+∞)f:(0,+\infty) \to (0,+\infty) that satisfy (i)(i) f(xf(y))=yf(x),∀x,y>0,f(xf(y))=yf(x), \forall x,y > 0, (ii)(ii) lim⁡x→+∞f(x)=0.\lim_{x\to+\infty} f(x) = 0.

Answer, solutions and source

Problem 2

  • Day 1

A boa of size kk is a graph with k+1k+1 vertices {0,1,…,k−1,k}\{0,1,\dots,k-1,k\} and edges only between the vertices ii and i+1i+1 for 0≤i<k.0\leq i < k. The boa is place in a graph GG through a injection of graphs. (This is an injective function form the vertices of the boa to the vertices of the graph in such a way that if there is an edge between the vertices xx and yy in the boa then there must be an edge between f(x)f(x) and f(y)f(y) in GG ). The Boa can move in the graph GG using to type of movement each time. If the boa is initially on the vertices f(0),f(1),…,f(k)f(0),f(1),\dots,f(k) then it moves in one of the following ways:

(i) It choose vv a neighbor of f(k)f(k) such that v∉{f(0),f(1),…,f(k−1)}v\not\in\{f(0),f(1),\dots,f(k-1)\} and the boa now moves to f(0),f(1),…,f(k)f(0),f(1),\dots,f(k) with f′(k)=vf'(k)=v and f′(i)=f(i+1)f'(i) = f(i+1) for 0≤i<k,0 \leq i < k, or

(ii) It choose vv a neighbor of f(0)f(0) such that v∉{f(1),f(2),…,f(k)}v\not\in\{f(1),f(2),\dots,f(k)\} and the boa now moves to f(0),f(1),…,f(k)f(0),f(1),\dots,f(k) with f′(0)=vf'(0)=v and f′(i)=f′(i−1)f'(i) = f'(i-1) for 0<i≤k.0 < i \leq k. Prove that if GG is a connected graph with diameter dd , then it is possible to put a size ⌈d/2⌉\lceil d/2 \rceil boa in GG such that the boa can reach any vertex of GG .

Answer, solutions and source

Day 2