2015 Chile Classification / Qualifying NMO Juniors XXVII
Source:
October 11, 2021
algebrageometrynumber theorycombinatoricschilean NMO
Problem Statement
p1. Consider a grid board of cells. What is the maximum number of lockers that can be painted black so that are there no more than black boxes in each row, each column and each diagonal of the board?
p2. On a blackboard, points , , and are still drawn so that they form an convex quadrilateral. Find a point inside the quadrilateral of so that the sum of the distances to the vertices is the smallest possible.
p3. Find all the prime numbers such that is a prime number.
p4. Determine if the number is a perfect square.
p5. Consider a triangle , and a point inside it. When drawing the lines , and , the intersection points , and are determined on the sides , and respectively. The triangle is divided into 6 triangles (, , , , , ). Show that if of these triangles have the same area then points , , are the midpoints of the respective sides.
p6. Sebastian and Fernando are preparing to play the following game: at a table there are tokens, which are red on one side and black on the other. Initially the tokens are randomly flipped and played alternately in turns. On each shift, it is allowed remove any non-zero quantity of tokens of the same color or flip any quantity not null of sheets of the same color. Whoever removes the last token wins. If Sebastian plays first, who has a winning strategy?PS. Juniors P3, P5 were also proposed as [url=https://artofproblemsolving.com/community/c4h2693883p23392778]Seniors P1, P4.