Prove that there exists a function such that (i) whenever ; and (ii) if then .
SCHWEITZER 2000
Miklós Schweitzer Competition 2000.
Other problems
Let red and blue subarcs of a circle be given such that each red subarc intersects each blue subarc. Prove that there is a point which is covered by at least of the given (red or blue) subarcs.
Prove that for every integer there exists with the following property: whenever is a set of at least points of the plane such that any three points of determines a nondegenerate triangle containing at most one point of in its interior, then contains the vertices of a convex -gon whose interior does not contain any point of .
Let be positive integers. Prove that there are integers such that , and .
Prove that for every there exists a positive integer and there are positive numbers such that for every we have .
Suppose the real line is decomposed into two uncountable Borel sets. Prove that a suitable translated copy of the first set intersects the second in an uncountable set.
Let denote the space of functions holomorphic on the disc , endowed with the topology of uniform convergence on each compact subset of . If , then we shall denote . A function is called universal if, for every continuous function and for every , there are partial sums approximating uniformly on the arc . Prove that the set of universal functions contains a dense subset of .
Let be a map such that the image of every compact set is compact, and the image of every connected set is connected. Prove that is continuous.
Let be a closed, orientable -dimensional differentiable manifold, and let be a finite group of orientation preserving diffeomorphisms of . Let and denote the set of those points of whose stabilizer is nontrivial (that is, contains a nonidentity element of ) and noncyclic, respectively. Let denote the Euler characteristic of . Prove that the order of divides , and is the union of orbits of .
Joe generates 4 independent random numbers in according to the uniform distribution. He shows one the numbers to Bill, who has to guess whether the number shown is one of the extremal numbers (that is, the smallest or the greatest) of the four numbers or not. Can Joe have a deterministic strategy such that no matter what Bill's method is, the probability of the right guess of Bill is at most ?