olymmath

OMCC 2018

Centroamerican and Caribbean Mathematical Olympiad 2018.

Day 1

Problem 1

  • Day 1

There are 2018 cards numbered from 1 to 2018. The numbers of the cards are visible at all times. Tito and Pepe play a game. Starting with Tito, they take turns picking cards until they're finished. Then each player sums the numbers on his cards and whoever has an even sum wins. Determine which player has a winning strategy and describe it.

P.S. Proposed by yours truly :-D

Answer, solutions and source

Problem 2

  • Day 1

Let ΔABC\Delta ABC be a triangle inscribed in the circumference ω\omega of center OO . Let TT be the symmetric of CC respect to OO and T′T' be the reflection of TT respect to line ABAB . Line BT′BT' intersects ω\omega again at RR . The perpendicular to CTCT through OO intersects line ACAC at LL . Let NN be the intersection of lines TRTR and ACAC . Prove that CN‾=2AL‾\overline{CN}=2\overline{AL} .

Answer, solutions and source

Problem 3

  • Day 1

Let x,yx, y be real numbers such that x−y,x2−y2,x3−y3x-y, x^2-y^2, x^3-y^3 are all prime numbers. Prove that x−y=3x-y=3 .

EDIT: Problem submitted by Leonel Castillo, Panama.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Determine all triples (p,q,r)(p, q, r) of positive integers, where p,qp, q are also primes, such that r2−5q2p2−1=2\frac{r^2-5q^2}{p^2-1}=2 .

Answer, solutions and source

Problem 5

  • Day 2

Let nn be a positive integer, 1<n<20181<n<2018 . For each i=1,2,…,ni=1, 2, \ldots ,n we define the polynomial Si(x)=x2−2018x+liS_i(x)=x^2-2018x+l_i , where l1,l2,…,lnl_1, l_2, \ldots, l_n are distinct positive integers. If the polynomial S1(x)+S2(x)+⋯+Sn(x)S_1(x)+S_2(x)+\cdots+S_n(x) has at least an integer root, prove that at least one of the lil_i is greater or equal than 20182018 .

Answer, solutions and source

Problem 6

  • Day 2

A dance with 2018 couples takes place in Havana. For the dance, 2018 distinct points labeled 0,1,…,20170, 1,\ldots, 2017 are marked in a circumference and each couple is placed on a different point. For i≥1i\geq1 , let si=i (mod 2018)s_i=i\ (\textrm{mod}\ 2018) and ri=2i (mod 2018)r_i=2i\ (\textrm{mod}\ 2018) . The dance begins at minute 00 . On the ii -th minute, the couple at point sis_i (if there's any) moves to point rir_i , the couple on point rir_i (if there's any) drops out, and the dance continues with the remaining couples. The dance ends after 201822018^2 minutes. Determine how many couples remain at the end.

Note: If ri=sir_i=s_i , the couple on sis_i stays there and does not drop out.

Answer, solutions and source