olymmath

PAGMO 2021

Pan-American Girls' Mathematical Olympiad 2021.

Other problems

Problem 1

There are n≥2n \geq 2 coins numbered from 11 to nn . These coins are placed around a circle, not necesarily in order.

In each turn, if we are on the coin numbered ii , we will jump to the one ii places from it, always in a clockwise order, beginning with coin number 1. For an example, see the figure below.

Find all values of nn for which there exists an arrangement of the coins in which every coin will be visited.

Attachments:

Screen Shot 2021-10-06 at 17.13.15.png

Problem 2

Consider the isosceles right triangle ABCABC with ∠BAC=90∘\angle BAC = 90^\circ . Let ℓ\ell be the line passing through BB and the midpoint of side ACAC . Let Γ\Gamma be the circumference with diameter ABAB . The line ℓ\ell and the circumference Γ\Gamma meet at point PP , different from BB . Show that the circumference passing through A, CA,\ C and PP is tangent to line BCBC at CC .

Problem 3

Let R\mathbb{R} be the set of real numbers. Determine all functions f:R⟶Rf: \mathbb{R}\longrightarrow \mathbb{R} so that the equality f(x+yf(x+y))+xf(x)=f(xf(x+y+1))+y2f(x+yf(x+y)) +xf(x)= f(xf(x+y+1))+y^2 is true for any real numbers x,yx,y .

Problem 4

Lucía multiplies some positive one-digit numbers (not necessarily distinct) and obtains a number nn greater than 10. Then, she multiplies all the digits of nn and obtains an odd number. Find all possible values of the units digit of nn . Proposed by Pablo Serrano, Ecuador\textit{Proposed by Pablo Serrano, Ecuador}

Problem 5

Celeste has an unlimited amount of each type of nn types of candy, numerated type 1, type 2, ... type n. Initially she takes m>0m>0 candy pieces and places them in a row on a table. Then, she chooses one of the following operations (if available) and executes it: 1.1. She eats a candy of type kk , and in its position in the row she places one candy type k−1k-1 followed by one candy type k+1k+1 (we consider type n+1n+1 to be type 1, and type 0 to be type nn ). 2.2. She chooses two consecutive candies which are the same type, and eats them.

Find all positive integers nn for which Celeste can leave the table empty for any value of mm and any configuration of candies on the table. Proposed by Federico Bach and Santiago Rodriguez, Colombia\textit{Proposed by Federico Bach and Santiago Rodriguez, Colombia}

Problem 6

Let ABCABC be a triangle with incenter II , and AA -excenter Γ\Gamma . Let A1,B1,C1A_1,B_1,C_1 be the points of tangency of Γ\Gamma with BC,ACBC,AC and ABAB , respectively. Suppose IA1,IB1IA_1, IB_1 and IC1IC_1 intersect Γ\Gamma for the second time at points A2,B2,C2A_2,B_2,C_2 , respectively. MM is the midpoint of segment AA1AA_1 . If the intersection of A1B1A_1B_1 and A2B2A_2B_2 is XX , and the intersection of A1C1A_1C_1 and A2C2A_2C_2 is YY , prove that MX=MYMX=MY .