olymmath

PAMO 2018

Pan-African Mathematics Olympiad 2018.

Day 1

Problem 1

  • Day 1

Find all functions f:Z→Zf : \mathbb Z \to \mathbb Z such that (f(x+y))2=f(x2)+f(y2)(f(x + y))^2 = f(x^2) + f(y^2) for all x,y∈Zx, y \in \mathbb Z .

Answer, solutions and source

Problem 2

  • Day 1

A chess tournament is held with the participation of boys and girls. The girls are twice as many as boys. Each player plays against each other player exactly once. By the end of the tournament, there were no draws and the ratio of girl winnings to boy winnings was 79\frac{7}{9} .

How many players took part at the tournament?

Answer, solutions and source

Problem 3

  • Day 1

For any positive integer xx , we set g(x)= largest odd divisor of x,g(x) = \text{ largest odd divisor of } x, f(x)={x2+xg(x) if x is even;2x+12 if x is odd.f(x) = \begin{cases} \frac{x}{2} + \frac{x}{g(x)} & \text{ if } x \text{ is even;} 2^{\frac{x+1}{2}} & \text{ if } x \text{ is odd.} \end{cases} Consider the sequence (xn)n∈N(x_n)_{n \in \mathbb{N}} defined by x1=1x_1 = 1 , xn+1=f(xn)x_{n + 1} = f(x_n) . Show that the integer 20182018 appears in this sequence, determine the least integer nn such that xn=2018x_n = 2018 , and determine whether nn is unique or not.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Given a triangle ABCABC , let DD be the intersection of the line through AA perpendicular to ABAB , and the line through BB perpendicular to BCBC . Let PP be a point inside the triangle. Show that DAPBDAPB is cyclic if and only if ∠BAP=∠CBP\angle BAP = \angle CBP .

Answer, solutions and source

Problem 5

  • Day 2

Let aa , bb , cc and dd be non-zero pairwise different real numbers such that ab+bc+cd+da=4 and ac=bd.\frac{a}{b} + \frac{b}{c} + \frac{c}{d} + \frac{d}{a} = 4 \text{ and } ac = bd. Show that ac+bd+ca+db≤−12\frac{a}{c} + \frac{b}{d} + \frac{c}{a} + \frac{d}{b} \leq -12 and that −12-12 is the maximum.

Answer, solutions and source

Problem 6

  • Day 2

A circle is divided into nn sectors ( n≥3n \geq 3 ). Each sector can be filled in with either 11 or 00 . Choose any sector C\mathcal{C} occupied by 00 , change it into a 11 and simultaneously change the symbols x,yx, y in the two sectors adjacent to C\mathcal{C} to their complements 1−x1-x , 1−y1-y . We repeat this process as long as there exists a zero in some sector. In the initial configuration there is a 00 in one sector and 11 s elsewhere. For which values of nn can we end this process?

Answer, solutions and source