There are n points in the plane with the property that the distance between any two points is at least 1. Prove that for sufficiently large n , the number of pairs of points whose distance is in for some , is at most , and the bound is sharp.
SCHWEITZER 1993
Miklós Schweitzer Competition 1993.
Other problems
Let A be a subset of natural numbers and let k , r be positive integers. Suppose that for any r different elements selected from A , their greatest common divisor has at most k different prime factors. Prove that A can be partitioned into B and C , where any element of B has at most k + 1 different prime divisors and
Let K be the field formed by the addition of a root of the polynomial to the rational field. Prove that there are no exceptional units in the ring of integers of K. (A unit is called exceptional if is also a unit.)
Let f be a ternary operation on a set of at least four elements for which (1) (2) for pairwise distinct x,y,z. Prove that f is a nontrivial composition of g such that g is not a composition of f. (The n-variable operation g is trivial if for some i ( ) )
Does the set of real numbers have a well-order such that the intersection of the subset of the plane with every line is Lebesgue measurable on the line?
Let be arbitrary points and A be a connected compact set in the plane with a diameter greater than 4. Show that for some point P in A , . Furthermore, prove that this is no longer necessarily true for compact sets of diameter 4.
Let H be a Hilbert space over the field of real numbers . Find all continuous functions for which is satisfied for any .
Let H be a complex separable Hilbert space and denote the algebra of bounded linear operators on H. Find all *-subalgebras C of for which for all and there exists that note: *-algebra is also known as involutive algebra.
Let be iid random variables on [0,1], which in order of magnitude, . Let such that ( j = 1,2,3). Prove that