2002 Chile NMO Juniors XIV
Source:
October 18, 2021
algebrageometrynumber theorycombinatoricschilean NMO
Problem Statement
p1. The next game is played between two players with a pile of peanuts. The game starts with the man pile being divided into two piles (not necessarily the same size). A move consists of eating all the mana in one pile and dividing the other into two non-empty piles, not necessarily the same size. Players take turns making their moves and the last one wins that I can make a move Show that if the starting number of mana is in at least one of the stacks is even, so the first player can win no matter how his opponent plays (that is, he has a perfect strategy to win).
[url=https://artofproblemsolving.com/community/c4h1847975p12452018]p2. If in the , two sides are not greater than their corresponding altitudes, how much do the angles of the triangle measure?
p3. Eight players participated in a free-for-all chess tournament. All players obtained different final scores, the one who finished second having obtained as many points as a total were obtained by the four worst-performing players. What was the result between the players who got fourth and fifth place?
p4. Let be a number of digits, divisible by . Let be the sum of the digits of . Let the sum of the digits of . Let be the sum of the digits of . Determine the value of .
[url=https://artofproblemsolving.com/community/c4h2916289p26046171]p5. Given a right triangle angle , where the coordinates of its vertices are integer numbers, let be the number of integer coordinate points that belong to the edge of the triangle , the number of integer coordinate points belonging to the interior of the triangle . Prove that the area of the triangle is given by: .
p6. Given a board, determine the value of natural with the following properties:
If there are less than tiles on the board, then two rows and two columns can be found such that if they are erased, there will be no pieces left on the board.
On the board, tiles can be placed in such a way that when erasing any two rows and two any columns, there will always be at least one tile on the board
[url=https://artofproblemsolving.com/community/c4h1847977p12452026]p7. Given the segment , let be one point lying on it. Towards the same side of the plane and with base and , the squares and are constructed. Let and be the respective centers of these squares. Determine how the midpoint of the segment moves as the point moves along the segment.