olymmath

OMCC 1999

Centroamerican and Caribbean Mathematical Olympiad 1999.

Day 1

Problem 1

  • Day 1

Suppose that each of the 5 persons knows a piece of information, each piece is different, about a certain event. Each time person AA calls person BB , AA gives BB all the information that AA knows at that moment about the event, while BB does not say to AA anything that he knew.

(a) What is the minimum number of calls are necessary so that everyone knows about the event? (b) How many calls are necessary if there were nn persons?

Answer, solutions and source

Problem 2

  • Day 1

Find a positive integer nn with 1000 digits, all distinct from zero, with the following property: it's possible to group the digits of nn into 500 pairs in such a way that if the two digits of each pair are multiplied and then add the 500 products, it results a number mm that is a divisor of nn .

Answer, solutions and source

Problem 3

  • Day 1

The digits of a calculator (with the exception of 0) are shown in the form indicated by the figure below, where there is also a button +": ![Image](6965) Two players AA and BB play in the following manner: AA turns on the calculator and presses a digit, and then presses the button +". AA passes the calculator to BB , which presses a digit in the same row or column with the one pressed by AA that is not the same as the last one pressed by AA ; and then presses + and returns the calculator to AA , repeating the operation in this manner successively. The first player that reaches or exceeds the sum of 31 loses the game. Which of the two players have a winning strategy and what is it?

Answer, solutions and source

Day 2

Problem 4

  • Day 2

In the trapezoid ABCDABCD with bases ABAB and CDCD , let MM be the midpoint of side DADA . If BC=aBC=a , MC=bMC=b and ∠MCB=150∘\angle MCB=150^\circ , what is the area of trapezoid ABCDABCD as a function of aa and bb ?

Answer, solutions and source

Problem 5

  • Day 2

Let aa be an odd positive integer greater than 17 such that 3a−23a-2 is a perfect square. Show that there exist distinct positive integers bb and cc such that a+b,a+c,b+ca+b,a+c,b+c and a+b+ca+b+c are four perfect squares.

Answer, solutions and source

Problem 6

  • Day 2

Denote SS as the subset of {1,2,3,…,1000}\{1,2,3,\dots,1000\} with the property that none of the sums of two different elements in SS is in SS . Find the maximum number of elements in SS .

Answer, solutions and source