MathDB
2015 Chile Classification / Qualifying NMO Juniors XXVII

Source:

October 11, 2021
algebrageometrynumber theorycombinatoricschilean NMO

Problem Statement

p1. Consider a grid board of 16×1616\times 16 cells. What is the maximum number of lockers that can be painted black so that are there no more than 8 8 black boxes in each row, each column and each diagonal of the board?
p2. On a blackboard, 44 points A A, B B, CC and DD are still drawn so that they form an convex quadrilateral. Find a point EE inside the quadrilateral of so that the sum of the distances to the 44 vertices is the smallest possible.
p3. Find all the prime numbers pp such that 2p+p22^p + p^2 is a prime number.
p4. Determine if the number 1!+2!+...+2015!1! + 2! + ... + 2015! is a perfect square.
p5. Consider a triangle ABC\vartriangle ABC, and a point PP inside it. When drawing the lines APAP, BPBP and CPCP, the intersection points DD, EE and FF are determined on the sides BCBC, CACA and ABAB respectively. The triangle is divided into 6 triangles (AFP\vartriangle AFP, FPB\vartriangle FPB, BDP\vartriangle BDP, DPC\vartriangle DPC, CPE\vartriangle CPE, EPA\vartriangle EPA). Show that if 44 of these triangles have the same area then points DD, EE, FF are the midpoints of the respective sides.
p6. Sebastian and Fernando are preparing to play the following game: at a table there are 20152015 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.