Академический Документы
Профессиональный Документы
Культура Документы
nizes the selection of students to form the Italian team to compete in the Interna-
tional Mathematical Olympiads: the “Progetto Olimpiadi della Matematica”.
The project is sponsored by the Italian Ministery for Education, University and
Research MIUR, Ministero dell’Istruzione, dell’Università e della Ricerca,
and is actively supported by a very large number of mathematics teachers through-
out the country.
The selection of students is in three stages:
1. I giochi di Archimede are held in midNovember in each participating school:
they consist of a collection of some twenty, twenty-five multiple choice prob-
lems. They are designed to be suitable for a vast number of students of all
kinds of schools (nearly all Italian schools take part in this) so that the ques-
tions require mainly a quick intuition, but possibly few technical abilities.
Different problems are set for junior students in the first two levels at high
school, and for senior students.
2. Le gare di febbraio are held in midFebruary in each of the one hundred math-
ematical zones which cover Italy. Only students with best results in “I giochi
di Archimede” take part in this. Problems include multiple choice problems,
others with a numeric answer, and yet others which require a mathematical
proof.
3. Le Olimpiadi Italiane della Matematica is the final stage where the best stu-
dents from each zone test their mathematical abilities with problems which
require both calcutions and proofs. It is held in the second weekend of May
in Cesenatico, on the Adriatic coast, south of Venice.
The present pamphlet collects all the problems given during the selection process
in view of the 2006 I.M.O. in Ljubljana. A grid with the bare answers appears at
the end of the first two section, where the reader may also find some hints. There
are complete solutions for the problems of the final stage and of the team selection
test.
distinct triples are there such that v = d + l? (Note: the triples are ordered, so, for
instance, (19, 12, 7) and (19, 7, 12) are to be considered distinct.)
(A) 19 (B) 20 (C) 38 (D) 40 (E) none of the previous
8 ABC is a right triangle and the catheti AB and AC are respectively 3m and 4m
long. Let B 0 and C 0 be points belonging to the sides AB and AC respectively, such
that the line B 0 C 0 is parallel to the line BC and the distance between the two lines
is 1m. The area of the triangle AB 0 C 0 is:
49 2 65 2 7
(A) m , (B) 2m2 , (C) m , (D) m2 , (E) none of the previous
24 24 2
9 For any natural number n, the product (n + 2)(n + 3)(2n + 5) is always divisible
by:
(A) 4 (B) 6 (C) 9 (D) 10 (E) 15
10 How many ordered pairs of integers (a, b) are there such that the sum a + b is
equal to the product ab?
(A) None (B) one (C) two (D) four (E) more than four
11 Frank finds an old combination padlock: the padlock is closed and to open it
he must align three digits in the correct order, every one of which can vary between
0 and 9. Frank does not remember the correct combination, but he is sure that
the sum of three digits is 10. How many tries will it take him, at most, to find the
correct combination?
(A) 61 (B) 63 (C) 65 (D) 67 (E) 69
12 In a triangle, for each pair of sides the two axes and the bisecting line of the
angle formed by the two sides intersect in the same point. We can state that:
(A) there are no triangles with this property (B) the triangle is equilateral (C)
the triangle has an angle of 30◦ (D) the triangle is a right triangle (E) the
triangle has an angle of 45◦
13 How many are the integers greater than or equal to 1 and less than or equal to 100
which are equal to the square of the number of their positive divisors? (Remember:
among the divisors of a number there are also 1 and the number itself.)
(A) 0 (B) 2 (C) 3 (D) 4 (E) 5
14 For every integer n between 10 and 90 (10 and 90 included), the product of
its digits is added to the sum of its digits, obtaining a new number S(n). For how
many integers n is S(n) equal to n?
(A) 8 (B) 9 (C) 10 (D) 11 (E) 12
15 We have two circles, one whose radius measures 1m and one whose radius
measures 3m. Knowing that there are two lines perpendicular to each other, each of
which is tangent to both circumferences, what is the minimal value that the distance
between
√ the centres√of the two circles
√ can have?
√ √ √
(A) 2m, (B) 2 2m, (C) ( 2 + 5)m, (D) 2 5m, (E) 4 2m
3
16 Alex has not done his homework, and as a punishment his teacher makes him
write on a piece of paper all the numbers from 1 to 2005 (writing each number only
once). How many times will Alex have to write the digit 1?
(A) 1490 (B) 1491 (C) 1600 (D) 1601 (E) 1610
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
D C B E D D B A B C B B C B B D C D C E
4
12 A math test has ten multiple choice questions, each one of which has four
possible answers, marked by the letters A, B, C and D. For each question there is
only one correct answer. Charlie finds out that in the list of correct answers there
are three A’s, three B’s, two C’s and two D’s. What probability does Charlie have,
choosing a random list of answers that satisfies these conditions, to answer all ten
questions correctly?
(A) 1/26500 (B) 1/25200 (C) 1/24600 (D) 1/21200 (E) 1/20800
13 How many are the integers greater than or equal to 1 and less than or equal to 100
which are equal to the square of the number of their positive divisors? (Remember:
among the divisors of a number there are also 1 and the number itself.)
(A) 0 (B) 2 (C) 3 (D) 4 (E) 5
14 How many real numbers x are solutions to the equation |x − 2| − 4 = 1/|x − 3|?
(A) none (B) 2 (C) 3 (D) 4 (E) more than four
16 Alex has not done his homework, and as a punishment his teacher makes him
write on a piece of paper all the numbers from 1 to 2005 (writing each number only
once). How many times will Alex have to write the digit 1?
(A) 1490 (B) 1491 (C) 1600 (D) 1601 (E) 1610
17 A group of 24 friends go to a dinner, and they all sit at a round table. Every
girl in the group says, “I am sitting beside a boy”. There are twice as many girls as
there are boys. How many girls are certainly lying?
(A) 0 (B) 4 (C) 8 (D) 19 (E) cannot be determined
7 Two circumferences with the same radius intersect in the points X and Y . Let
P be a point on the arc XY of one of the two circumferences which is internal to
the other circumference. Knowing that the segment XY measures 3 and that the
angle X PbY √measures 120◦ , the
√ area of the intersection
√ of the two √
circles?
(A) 2(π − 4 3) (B) 3(π − 3) (C) 21 (3π − 3) (D) 2(π − 23 3) (E) 2(π −
1
3
√
4 3)
8 Let ABC be a triangle and A0 the symmetrical of A with respect to BC. Let DAA0
be a triangle similar to ABC and D0 the symmetrical of D with respect to AA0 .
If the area of the quadrilateral ABA0 C multiplied by the area of the quadrilateral
ADA0 D equals√16, it is possible to√determine that the measure of AA0 is. . .
(A) 1 (B) 2 4 2 (C) 2 (D) 2 2 (E) not uniquely determined
√
q p
9 How many square roots must there be in the expression · · · 123.456.789 so
that the result is less than 2?
(A) 5 (B) 6 (C) 7 (D) 8 (E) 9
p
3
√ p
3
√
10 The computation of 2 + 5 + 2 − 5 gives. . .
p
3
√ √ √
(A) 9 − 4 5 (B) 1 (C) 32 (D) 3 4 (E) 2 3 2
11 The members of a tribe have ten fingers in each hand and nine toes in each
foot, so they count both in base 10 or in base 19. In their mathematical culture,
a positive integer is called “holy” if it is written in both bases with the same two
digits. How many holy numbers are there?
12 Someone wrote on the blackboard a 17-digit number whose digits are only 1 and
2. Paul walks in and writes the same number backwards, with the digits aligned
with the previous one. James walks in and writes beneath each column the greatest
digit that appears in that column. Albert walk in and writes beneath each column
the smallest digit that appears in that column, then erases the first two numbers.
Megan walks in and sees the numbers 12212212221221221 and 11211111211111211
on the blackboard. She is told what Paul, James and Albert have done. How many
are the number which could have been written on the blackboard before Paul came
in?
13 Let ABCD be a parallelogram. It is known that AB measures 6, that the
b measures 60◦ and that ADB
angle B AD b measures 90◦ . Let P be the barycenter of
the triangle ACD. What is the product of the areas of the triangle ABP and the
quadrilateral ACP D?
√
14 In a pyramid with a square base,√the sides of the base measure 3 and all of
the sides of the lateral faces measure 2. How wide is the angle between two sides
which do not belong to the same lateral face?
15 How many five digit numbers (i.e. greater than or equal to 10000 and less than
or equal to 99999) do not contain zeros or multiples of 12?
9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
E E C A C B E D A B 4 16 27 120 4374
Sketch of proof of 16: Since multiplication Sketch of proof of 17: Let M and N be
by 5 is one-one, for a given k > 0, the positive the centres of the circumferences of diameters
integers satisfying conditions (a) and (b) are as AB and AC, respectively. Triangles AM N and
many as those m such that both m and 5m have ABC are similar; so M N is parallel to BC.It is
k digits in base 10, all odd. Let m1 m2 . . . mk also perpendicular to AE as common chord of
be m in decimal notation: the leading digits m1 the two circles. Hence AD is parallel to M N if
must be 1. And, for i = 2, . . . , k the number 5mi and only if it is perpendicular to AE.
must be either 5, 25, or 45, as the ten’s digit of
5mi must be even to add to an odd number with
the unit’s digit 5 of 5mi−1 . Hence the function
requested is k 7→ 3k−1 .
XXI Olimpiadi Italiane della Matematica
Cesenatico, 5 May 2006
1 Rose and Savino play the following game with the a deck of traditional Neapolitan
playing cards: 40 cards of four different suits, numbered 1 to 10. At the beginning
each player has 20 cards; taking turns, one shows a card on the table. Whenever
some cards on the table add to 15 exactly, these are removed from the game (if the
sum 15 can be reached in more than one way, the player who has moved last decides
which cards adding to 15 to removed). At the end of the game that Rose and Savino
area playing, only one 9 card is left on the table, Savino holds two cards numbered
3 and 5 in his hand and Rose holds one card. What is the number on Rose’s card?
2 Find all values of m, n, p such that
pn + 144 = m2
17 16 15 14 13
18 5 4 3 12
19 6 1 2 11
20 7 8 9 10
21 22 23 24 25
A “right half-line” of the chessboard is the set of squares given by a square C and
by all squares lying on the same row as C and to the right of C
1. Prove that there exists a right half-line none of whose squares contains a
multiple of 3.
2. Determine if there exist infinitely many pairwise disjoint right half-lines none
of whose squares contains a multiple of 3.
5 Consider the inequality
1. Determine for which n ≥ 3 the inequality holds true for all possible choices of
positive real numbers x1 , . . . , xn .
2. Determine for which n ≥ 3 the inequality holds true for all possible choices of
real numbers x1 , . . . , xn .
6 Albert and Barbara play the following game: at the beginning there are some
piles of coins on the table, not all necessarily with the same number of coins. The
players move in turn and Albert starts. Each player makes one and only one of the
following possible moves:
• either one removes a coin out of a pile;
• or one divides a pile into two piles, each pile with at least a coin.
The one who takes the last coin out of the table wins the game. Depending on the
number of piles and on the number of coins that each pile contains at the beginniing,
find which of the players has a winning strategy.
Solution to 1: The number on the card is 8.
10 · 11
Because the total sum of cards is · 4 = 220. and the sum of those removed
2
is a multiple of 15. The number on the card in Rose’s hand is the reminder of the
division of 220 − (5 + 3 + 9) = 203 by 15.
Solution to 2: The possible values for (m, n, p) are (13, 2, 5), (20, 8, 2), and
(15, 4, 3).
Because the condition on m, n, p is equivalent to pn (m + 12)(m − 12). So,
(
m + 12 = pa
m − 12 = pb
for some positive integers a > b with a + b = n. It follows that 24 = pb (pa−b − 1).
Either pb = 1 or p = 2 (and b = 3 as p does not divide pa−b − 1) or p = 3. It is easy
to compute the values of m, n and p in each case.
Solution to 3: The locus is the circumference symmetric to Γ with respect to AB
without the points symmetric to A and B.
Let C be diametrically opposed to B on Γ, C AB b is a right angle, thus P H and
CA are parallel, as both are perpendicular to AB. Similarly, C PbB is a right angle,
hence CP e AH are parallel.
Thus AHP C is a parallelogram and P H = AC for every P in Γ, and P H is
−−→
perpendicular to AB. Hence the vector P H is constant as P moves on Γ.
−−→ −→
The required locus is the translation of the circumference Γ by the vector P H ≡ CA,
without the translations of A and B which are precisely A0 and B 0 .
Solution to 4: The sequence of numbers which appear in the square before a
corner of the spiral is
So the number in the square before each other corner from the first square (that
with the number 1) is the next perfect square. And the square of 2j + 1 appears in
the j th line below the first square.
So the right half-line from 1 contains the numbers (2j −1)2 +j +1 = 3(j 2 −j)+j 2 +1
and 3(j 2 − j) + j 2 + 1 ≡ 1, 2(mod3).
Similarly, the j-th number to the right of the square with number (6k + 1)2 is
• is true for all positive real numbers in case n ≥ 4. The induction step is
proved by permuting x1 , . . . , xn , xn+1 so that x1 is the largest, and applying
the induction hypothesis to the n numbers x1 , . . . , xn + xn+1 .
Solution to 6: For a given configuration of piles on the table, let s be the number
of those piles with exactly one coin, and let r be the number of piles with an even
number of coins. A winning strategy is to play leaving opponent with a configuration
with both s and r even.
Italian Team Selection Test
Pisa, 20-21 May 2006
Day 1
1 Let S be a string with 99 characters, 66 of which are A’s and 33 are B’s. Say that
S is “good” if, for each initial substring of S (i.e. consisting of the first n characters,
1 ≤ n ≤ 99), the number of different words obtained by permuting the characters
of the substring is odd.
How many good strings are there? Which strings are good?
2 Let ABC be a triangle, let H be its orthocentre and let L, M , and N be the
midpoints of the sides AB, BC, and CA, respectively.
Prove that
HL2 + HM 2 + HN 2 < AL2 + BM 2 + CN 2
if and only if ABC is acutangle.
3 Find all integer functions f : Z → Z such that
Day 2
4 Let γ1 and γ2 be two intersecting circumferences, and let Q and R be their
intersection points. Let γ be a circumference such that the other two are internally
tangent to it, and let A1 and A2 be the tangency points of γ with γ1 and γ2 ,
respectively. Let P be a point on γ and let B1 and B2 be the other intersection
points of the segments P A1 and P A2 with γ1 and γ2 , respectively.
a) Prove that the tangent to γ1 in B1 and the tangent to γ2 in B2 are parallel.
b) Prove that B1 B2 is the common tangent to γ1 and γ2 if and only if P lies on
QR.
5 Let n be a positive integer, and let An be the set of all positive integers a less
than or equal to n such that n|(an + 1).
a) Find all n such that An is non-empty.
b) Find all n such that the cardinality |An | of An is even and non-zero.
c) Is there n such that |An | = 130?
6 Let p(x) be a polynomial with complex coefficients such that p(0) 6= 0. Prove
that there exists a multiple of p(x) with real positive coefficients (all coefficients,
from the constant term to the leading term) if and only if p(x) has no positive real
root.
14
For the solution of 1: Since the number of different words written with a A’s
and b B’s is na , the problem reduces to finding a path in Pascal’s Triangle which
touches only odd numbers, from the vertex to the number at position a = 33 in row
n = 99. There are odd numbers in row n = 64 only at the extremes, a = 0, 64,
n
and in row n = 96, only at positionsP ki a = 1, 32, 64, 96 since a is odd if and only
if a is a partial sum of n = i 2 , kj < kj+1 . There is a single good string:
A . . A} B
| .{z | .{z
. . B} AAB.
64 32