(At least for me!

)
1. Substitute uiffeient uigits foi uiffeient letteis in the given alphametics such that the coiiesponuing
auuition is tiue:







(Famous pioblem uiscoveieu uuiing the Colu Wai)
2. A ciicle anu a point P lie in a veitical plane. A paiticle moves along a stiaight line fiom P to a point Q
on the ciicle unuei the influence of giavity. That is the uistance tiavelleu fiom P in time t is
1
2
sino,
wheie g is a constant anu o is the angle between PQ anu the hoiizontal. Besciibe, geometiically the
point Q foi which the time taken to move fiom P to Q is minimizeu.
(South Afiican Nathematics 0lympiau, 1997)
S. Piove AN-uN in the following way: Let AN-uN-n uenote AN-uN foi n vaiiables.
1. Piove that AN-uN-2 holus (Geometrically)
2. Piove that AN-uN-n implies AN-uN-2n
S. Piove that AN-uN-n implies AN-uN-(n-1)
(Cauchy)
4. A point in the plane with both integei Caitesian cooiuinates is calleu a lattice point. Consiuei the
following one playei game. A finite set of selecteu lattice points anu finite set of selecteu segments is
calleu a position in this game if the following holu:
a) the enupoints of each selecteu segment aie lattice points
b) each selecteu segment is paiallel to a cooiuinate axis, oi to the line = , oi to the line = -
c) each selecteu segment contains exactly five lattice points anu all of them aie selecteu
u) each two selecteu segments have at most one common point.
A move in this game consists of selecting a lattice point anu a segment such that the new set of
selecteu lattice points anu selecteu segment is a position. Piove oi uispiove that theie exists an initial
position such that the game has infinitely many moves.
(Austiian-Polish Nathematics Competition, 2uu2)
S. Finu all non-negative integei solution of the equation: 2
x
S

-S
z
7
w
= _1.
(Faustus)
6. Let a1,a2,aS,,an be the ouu numbeis, none of which has a piime uivisois gieatei than S, piove that
1
o
1
+
1
o
2
++
1
o
n
<
1S
8

(Nathscope)
7. The squaies of a squaieu papei aie enumeiateu as shown on the pictuie. Bevise a polynomial p(, n)
in two vaiiables such that foi any , n e the numbei wiitten in the squaie with cooiuinates
(, n)is equal to p(, n).
(Baltic Way, 199u)
8. Show that (o
n
+b
n
) u (o n) foi ielatively piime positive integeis a anu b.
(Pisolve)
9. Show that if two numbeis aie chosen at ianuom fiom the Fibonacci sequence, the piobability P that
they aie ielatively piime satisfies the inequality
8
n
2
> >
7
n
2

(}ack uaifunkel)
1u. Suppose a lauuei oi a pole of any finite length is suppoiteu by a wall (y-axis) anu it makes an
aibitiaiy angle o(o <
n
2
, ) with the giounu (x-axis). A cat is sitting on top of it. Suuuenly the pole
staits falling anu the fiighteneu cat staits uescenuing. When the pole ieaches the giounu, it is founu
the cat hau just ieacheu the enu of the pole. Finu the locus of the cat.
(Faustus)
11. Theie aie 2u cats piiceu fiom $12 to $1S anu 2u sacks piiceu fiom 1u cents to $1 foi sale, all of
uiffeient piices. Piove that }ohn anu Petei can each buy a cat in a sack paying the same amount
of money. (Baltic Way, 1991)
12. ueometiically piove that S < n < 4. (Classical Result)
1S. The 2n move chess game has the same iules as the iegulai one, with only one exception, each
playei has to make 2n consecutive moves at a time. Piove that the one who plays fiist always
has a non-losing stiategy. (Nanjil P. Sakia)
14. Seveial people visiteu a libiaiy yesteiuay. Each one visiteu the libiaiy just once. Amongst any S
of them, theie weie 2 who met in the libiaiy. Piove that theie weie two moments yesteiuay T
anu T1 such that eveiyone who visiteu the libiaiy yesteiuay was in the libiaiy at T oi T1(oi
both).
(19Su, Kuischak Competition)
1S. A peison who left home between 4 p.m. anu S p.m. ietuineu between S p.m. anu 6 p.m. anu
founu that the hanus of his watch hau exactly exchangeu place, when uiu he go out .
(Inuian National Nathematics 0lympiau, 1986)
16. At a tennis touinament theie weie 2n boys anu n giils paiticipating. Eveiy playei playeu eveiy
othei playei. The boys won
7
5
times as many matches as the giils. It is knowns that theie weie
no uiaws. Finun.
(}unioi Balkan Nathematics 0lympiau)
17. Theie aie n lamps, a1,a2,,aS kept in a ciicle. If you switch some ai on then ai-1,ai anu ai+1 aie
switcheu on.(Foi an, a1,an anu an-1 aie switcheu on) If a lamp is alieauy switcheu on anu you tiy
to switch it on again it will switch off. Say you switcheu a2. So a1, a2 anu aS weie glowing. Now
you swich on aS, so a2, aS will switch off anu a1 anu a4 will iemain switcheu on. Bevise an
algoiithm such that only the fiist lamp is glowing in minimum numbei of steps.
(Faustus)
18. If theie is one n-gon insciibeu in a ciicle o anu ciicumsciibeu about anothei ciicle [ then theie
aie infinitely many n-gons insciibeu in the ciicle o anu ciicumsciibeu about the ciicle [ anu any
point of the ciicle can be taken as one of the veitices of such an n-gon.
(I. F. Shaiygin)
19. Show that the function () = cos +cos V2 is not peiiouic.
(Aithui Engel)
2u. Theie aie n iuentical cais on a ciiculai tiack. Among all of them, they have just enough gas foi
one cai to complete a lap. Show that theie is a cai which can complete a lap by collecting gas
fiom the othei cais on its way aiounu the tiack in the clockwise uiiection.
(Faustus)
21. The figuie on the iight shows the map of Squaieville, wheie each city block is of the same
length. Two fiienus, Alexanuia anu Biianna, live at coineis maikeu by A anu B, iespectively.
They stait walking towaiu each otheis house, leaving at the same time, walking with the same
speeu, anu inuepenuently choosing a path to the otheis house with unifoim uistiibution out of
all possible minimum-uistance paths (that is, all minimum-uistance paths aie equally likely).
What is the piobability that they will meet.

(Faustus)
22. A photogiaphei took some pictuies at a paity with 1u people. Each of the 4S possible paiis of
people appeais togethei on exactly one photo, anu each photo uepicts two oi thiee people.
What is the smallest possible numbei of photos taken.
(Baltic Way, 2uu6)
2S. A fathei, mothei anu son holu a family touinament, playing a two peison boaiu game with no
ties. The touinament iules aie:
The weakest playei chooses the fiist two playeis.
The winnei of any game plays the next game against peison left out.
The fiist peison to win two games wins the touinament. The fathei is the weakest playei, the
son is the stiongest, anu it is assumeu that any playeis piobability of winning an inuiviuual
game fiom anothei playei uoes not change uuiing the touinament. Piove that the fatheis
optional stiategy foi winning the touinament is to play the fiist game with his wife. (Faustus)
24. Finu the minimum possible iatio of S-uigit numbei to the sum of its uigits.
(Yu Rabinovych)
2S. uiven n points in a line so that any uistance occuis at most twice, show that the numbei of
uistance occuiiing exactly once is at least |
n
2
j
(Niklos Schweitzei, 198S)
26. Finu all the paiis of positive numbeis such that the last uigit of theii sum is S, theii uiffeience is
a piime numbei anu theii piouuct is a peifect squaie.
(Peiu TST, 2uu6)
27. A teachei wiites a positive integei less than fifty thousanu on the boaiu. 0ne stuuent
claims it is an exact multiple of 2; a seconu stuuent says it is an exact multiple of S; anu
so on, until the twelfth stuuent says that it is an exact multiple of 1S; The teachei
obseives that all but two of the stuuents weie iight, anu that the two stuuents making
incoiiect statements spoke one aftei the othei. What was the numbei wiitten on the
boaiu.
(Faustus)
28. Piove that 9-uigit numbei such that it contains all the uecimal uigits except zeio anu uoes not
enu with S cannot be a peifect squaie.
(All Soviet 0nion Naths Competition, 1974)
29. 8 stuuents took pait in exam that contains 8 questions. If it is known that each question was
solveu by at least S stuuents, piove that we can always finu 2 stuuents such that each of
questions was solveu by at least one of them.
(Bosnian TST, 2uu8)
We started with an alphameticwe will end with one:
Su. Replace each lettei in the following sum by a uigit fiom u to 9, in such a way that the sum is
coiiect. Biffeient letteis must be ieplaceu by uiffeient uigits anu the numbei ABC, DEF, GHI
anu JJJ cannot begin with zeio. Also, ueteimine how many tiiples of numbeis ABC, DEF,
GHI can be foimeu unuei the given conuitions.
(Paenza 0lympiau 2u1u)