Call a subset of the plane a circular set iff there exists a point such that for every ray starting from it, the ray intersects the subset once. show that the plane is a countable union of circular sets.
SCHWEITZER 1999
Miklós Schweitzer Competition 1999.
Other problems
Let e>0. Prove that for a large enough natural n, there exist natural x,y,z st and .
Prove that for any finite graph G there is a constant c(G)>0 such that for every n-point graph that does not have an induced subgraph isomorphic to G, there are two disjoint sets of vertices, each with at least elements, between which either all edges are connected, or none of the edges are.
A permutation f of the set of integers is called bounded if | x - f (x) | is bounded. Bounded permutations with permutation multiplication form a group W. Show that the additive group of rational numbers is not isomorphic to any subgroup of W.
Let , and be the solutions to the system of equations: , Prove that
Show that for every real function f in 1-period there exist three functions with the same properties and constants satisfying
let be a continuous function tf(t)>0 for . Prove that there exists a non-zero differentiable function such that and the roots of y are bounded.
Let and be oppositely oriented convex polygons. Prove that there is a line passing through the n line segments .
Let be the product of smooth, closed surfaces (2-dimensional, , compact, connected, manifold without boundary), of which are non-orientable. Prove that can be embedded in .
Let be iid rv, uniformly distributed over [0,1] , and for consider the sets , where [·] denotes the whole part. Prove that the elements of the sets form an almost surely bounded sequence if and only if .