Every brick has 5 holes in a line. The holes can be filled with bolts (fitting in one hole) and braces (fitting into two neighboring holes). No hole may remain free.
One puts n of these bricks in a line to form a pattern from left to right. In this line no two braces and no three bolts may be adjacent.
How many different such patterns can be produced with n bricks?
We consider permutations f of the set N of non-negative integers, i.e. bijective maps f from N to N , with the following additional properties: f(f(x))=xand∣f(x)−x∣⩽3for all x∈N.
Further, for all integers n>42 , M(n)=n+11j=0∑n∣f(j)−j∣<2,011.
Show that there are infinitely many natural numbers K such that f maps the set {n∣0⩽n⩽K} onto itself.
We are given a non-isosceles triangle ABC with incenter I . Show that the circumcircle k of the triangle AIB does not touch the lines CA and CB .
Let P be the second point of intersection of k with CA and let Q be the second point of intersection of k with CB .
Show that the four points A , B , P and Q (not necessarily in this order) are the vertices of a trapezoid.
Two circles k1 and k2 with radii r1 and r2 touch each outside at point Q . The other endpoints of the diameters through Q are P on k1 and R on k2 .
We choose two points A and B , one on each of the arcs PQ of k1 . ( PBQA is a convex quadrangle.)
Further, let C be the second point of intersection of the line AQ with k2 and let D be the second point of intersection of the line BQ with k2 .
The lines PB and RC intersect in U and the lines PA and RD intersect in V .
Show that there is a point Z that lies on all of these lines UV .