olymmath

PAMO 2019

Pan-African Mathematics Olympiad 2019.

Day 1

Problem 1

  • Day 1

Let (an)n=0∞(a_n)_{n=0}^{\infty} be a sequence of real numbers defined as follows:

  • a0=3a_0 = 3 , a1=2a_1 = 2 , and a2=12a_2 = 12 ; and
  • 2an+3−an+2−8an+1+4an=02a_{n + 3} - a_{n + 2} - 8a_{n + 1} + 4a_n = 0 for n≥0n \geq 0 .

Show that ana_n is always a strictly positive integer.

Answer, solutions and source

Problem 2

  • Day 1

Let kk be a positive integer. Consider kk not necessarily distinct prime numbers such that their product is ten times their sum. What are these primes and what is the value of kk ?

Answer, solutions and source

Problem 3

  • Day 1

Let ABCABC be a triangle, and DD , EE , FF points on the segments BCBC , CACA , and ABAB respectively such that BDDC=CEEA=AFFB.\frac{BD}{DC} = \frac{CE}{EA} = \frac{AF}{FB}. Show that if the centres of the circumscribed circles of the triangles DEFDEF and ABCABC coincide, then ABCABC is an equilateral triangle.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

The tangents to the circumcircle of △ABC\triangle ABC at BB and CC meet at DD . The circumcircle of △BCD\triangle BCD meets sides ACAC and ABAB again at EE and FF respectively. Let OO be the circumcentre of △ABC\triangle ABC . Show that AOAO is perpendicular to EFEF .

Answer, solutions and source

Problem 5

  • Day 2

A square is divided into N2N^2 equal smaller non-overlapping squares, where N≥3N \geq 3 . We are given a broken line which passes through the centres of all the smaller squares (such a broken line may intersect itself).

  • Show that it is possible to find a broken line composed of 44 segments for N=3N = 3 .
  • Find the minimum number of segments in this broken line for arbitrary NN .

Answer, solutions and source