olymmath

NL-NWO 1964

Dutch Mathematical Olympiad Final 1964.

Other problems

Problem 1

Given a triangle ABCABC , ∠C=60o\angle C= 60^o . Construct a point PP on the side ACAC and a point QQ on side BCBC such that ABQPABQP is a trapezoid whose diagonals make an angle of 60o60^o with each other.

Problem 2

Given is a flat plane VV containing a rectangular coordinate system xOyxOy . We consider quartets of numbers (p,q,r,s)(p,q,r,s) ; p≤0p\le 0 , q≤0q \le 0 , r≤0r \le 0 , s≤0s \le 0 . On every quartet we add a point SS from VV in a way that is in the accompanying figure is displayed. In this figure OP=pOP = p , PQ=qPQ = q , QR=rQR = r , RS=sRS = s , ∠OPQ=∠PQR=∠QRS=135o\angle OPQ = \angle PQR = \angle QRS = 135^o . (a) What is the set of the points of VV , which are added to these quartets ? (b) Which of these points has been added to only one quartet? How many quartets have the other points been added? (c) What is the set of points added to the quartets for which p+q=1p + q = 1 and r=s=0r = s = 0 ? (d) What is the set of points added to the quartets for which p+1=p + 1 = and r+s=1r + s = 1 ?

OO PP QQ RR SS XX YY

Problem 3

Solve (n+1)(n+10)=q2(n + 1)(n +10) = q^2 , for certain qq and maximum nn .

Problem 4

The function ƒƒ is defined at [0,1][0,1] , and f{f(x)}=ƒ(x)f\{f(x)\} = ƒ(x) . ∃c∈[0,1][f(c)=12]\exists _{c\in [0,1]} \left[f(c) =\frac12 \right] Determine f(12).f\left(\frac12 \right). ∀t∈[0,1]∃s∈[0,1][f(s)=t]\forall _{t\in [0,1]}\exists _{s\in [0,1]}[f(s) = t] . Determine ff .

Prove that the function gg , with g(x)=xg(x) = x , 0≤x≤k0 \le x \le k , g(x)=kg(x) = k , k≤x≤1k \le x \le 1 satisfies the relation g{g(x)}=g(x)g\{g(x)\} = g(x) .

Problem 5

Consider a sequence of non-negative integers g 1,g2,g3,..._1,g_2,g_3,... each consisting of three digits (numbers smaller than 100100 are also written with three digits; the number 2727 , for example, is written as 027027 ). Each number consists of the preceding by taking the product of the three digits that make up the preceding. The resulting sequence is of course dependent on the choice of g1g_1 (e.g. g1=359g_1 = 359 leads to g2=135g_2= 135 , g3=015g_3= 015 , g4=000g_4 = 000 ).Prove that independent of the choice of g1g_1 : (a) gn+1≤gng_{n+1}\le g_n (b) g10=000g_{10}= 000 .