2013 Nzmoc
2013 Nzmoc
2013 Nzmoc
. What is the ratio between the side length of C and the side length of C
?
5. Consider functions f from the whole numbers (non-negative integers) to the whole num-
bers that have the following properties:
For all x and y, f(xy) = f(x)f(y),
f(30) = 1, and
for any n whose last digit is 7, f(n) = 1.
Obviously, the function whose value at n is 1 for all n is one such function. Are there any
others? If not, why not, and if so, what are they?
6. ABCD is a quadrilateral having both an inscribed circle (one tangent to all four sides)
with center I, and a circumscribed circle with center O. Let S be the point of intersection
of the diagonals of ABCD. Show that if any two of S, I and O coincide, then ABCD is
a square (and hence all three coincide).
7. In a sequence of positive integers an inversion is a pair of positions such that the element
in the position to the left is greater than the element in the position to the right. For
instance the sequence 2,5,3,1,3 has ve inversions between the rst and fourth positions,
the second and all later positions, and between the third and fourth positions. What is
the largest possible number of inversions in a sequence of positive integers whose sum is
2014?
8. Suppose that a and b are positive integers such that
c = a +
b
a
1
b
is an integer. Prove that c is a perfect square.
9. Let ABC be a triangle with CAB > 45
. Construct an isosceles
right angled triangle RAB with AB as its hypotenuse and R inside ABC. Also construct
isosceles right angled triangles ACQ and BCP having AC and BC respectively as their
hypotenuses and lying entirely outside ABC. Show that CQRP is a parallelogram.
10. Find the largest possible real number C such that for all pairs (x, y) of real numbers with
x = y and xy = 2,
(x +y)
2
6
(x y)
2
+ 8
(x y)
2
C.
Also determine for which pairs (x, y) equality holds.
11. Show that we cannot nd 171 binary sequences (sequences of 0s and 1s), each of length
12 such that any two of them dier in at least four positions.
12. For a positive integer n, let p(n) denote the largest prime divisor of n. Show that there
exist innitely many positive integers m such that p(m1) < p(m) < p(m+ 1).