Scribd
Upload
96 views1 page

The 29th Nordic Mathematical Contest: Tuesday, March 24, 2015

The document summarizes the problems of the 29th Nordic Mathematical Contest. It includes 4 problems: 1) proving that 4 points are collinear based on a triangle and circles construction, 2) finding prime numbers given a relationship between their product and sum, 3) proving a polynomial defined by shifting another polynomial has many roots, 4) determining the number of permutations possible by repeatedly moving volumes in a stack in two specified ways. The time limit is 4 hours and each of the 4 problems is worth 7 points. Only writing and drawing tools are allowed.

Uploaded by

xpgong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
96 views1 page

The 29th Nordic Mathematical Contest: Tuesday, March 24, 2015

The document summarizes the problems of the 29th Nordic Mathematical Contest. It includes 4 problems: 1) proving that 4 points are collinear based on a triangle and circles construction, 2) finding prime numbers given a relationship between their product and sum, 3) proving a polynomial defined by shifting another polynomial has many roots, 4) determining the number of permutations possible by repeatedly moving volumes in a stack in two specified ways. The time limit is 4 hours and each of the 4 problems is worth 7 points. Only writing and drawing tools are allowed.

Uploaded by

xpgong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

The 29th Nordic Mathematical Contest

Tuesday, March 24, 2015

Problem 1.
Let ABC be a triangle and the circle with diameter AB. The bisectors of BAC and
ABC intersect (also) at D and E, respectively. The incircle of ABC meets BC and
AC at F and G, respectively. Prove that D, E, F and G are collinear.
Problem 2.
Find the primes p, q, r, given that one of the numbers pqr and p + q + r is 101 times the
other.
Problem 3.
Let n > 1 and p(x) = xn + an1 xn1 + + a0 be a polynomial with n real roots (counted
with multiplicity). Let the polynomial q be dened by
q(x) =

2015


p(x + j).

j=1

We know that p(2015) = 2015. Prove that q has at least 1970 dierent roots r1 , . . . , r1970
such that |rj | < 2015 for all j = 1, . . . , 1970.
Problem 4.
An encyclopedia consists of 2000 numbered volumes. The volumes are stacked in order
with number 1 on top and 2000 in the bottom. One may perform two operations with the
stack:
(i) For n even, one may take the top n volumes and put them in the bottom of the stack
without changing the order.
(ii) For n odd, one may take the top n volumes, turn the order around and put them on
top of the stack again.
How many dierent permutations of the volumes can be obtained by using these two
operations repeatedly?

Time allowed: 4 hours.


Each problem is worth 7 points.
Only writing and drawing tools are allowed.

You might also like