olymmath

SCHWEITZER 1976

Miklós Schweitzer Competition 1976.

Other problems

Problem 1

Assume that RR , a recursive, binary relation on N\mathbb{N} (the set of natural numbers), orders N\mathbb{N} into type ω\omega . Show that if f(n)f(n) is the nn th element of this order, then ff is not necessarily recursive.

L. Posa

Problem 2

Let GG be an infinite graph such that for any countably infinite vertex set AA there is a vertex pp , not in AA , joined to infinitely many elements of AA . Show that GG has a countably infinite vertex set AA such that GG contains uncountably infinitely many vertices pp joined to infinitely many elements of AA .

P. Erdos, A. Hajnal

Problem 3

Let HH denote the set of those natural numbers for which τ(n)\tau(n) divides nn , where τ(n)\tau(n) is the number of divisors of nn . Show that

a) n!∈Hn! \in H for all sufficiently large nn ,

b) HH has density 00 .

P. Erdos

Problem 4

Let Z\mathbb{Z} be the ring of rational integers. Construct an integral domain II satisfying the following conditions:

a) Z⫋I\mathbb{Z} \varsubsetneqq I ;

b) no element of I−ZI - \mathbb{Z} (only in II ) is algebraic over Z\mathbb{Z} (that is, not a root of a polynomial with coefficients in Z\mathbb{Z} );

c) II only has trivial endomorphisms.

E. Fried

Problem 5

Let Sν=∑j=1nbjzjν  (ν=0,±1,±2,...)S_{\nu}=\sum_{j=1}^n b_jz_j^{\nu} \;(\nu=0,\pm 1, \pm 2 ,...) , where the bjb_j are arbitrary and the zjz_j are nonzero complex numbers . Prove that ∣S0∣≤nmax⁡0<∣ν∣≤n∣Sν∣.|S_0| \leq n \max_{0<|\nu| \leq n} |S_{\nu}|.

G. Halasz

Problem 6

Let 0≤c≤10 \leq c \leq 1 , and let η\eta denote the order type of the set of rational numbers. Assume that with every rational number rr we associate a Lebesgue-measurable subset HrH_r of measure cc of the interval [0,1][0,1] . Prove the existence of a Lebesgue-measurable set H⊂[0,1]H \subset [0,1] of measure cc such that for every x∈Hx \in H the set {r:x∈Hr }\{r : x \in H_r\ \} contains a subset of type η\eta .

M. Laczkovich

Problem 7

Let f1,f2,…,fnf_1,f_2,\dots,f_n be regular functions on a domain of the complex plane, linearly independent over the complex field. Prove that the functions fif‾k,1≤i,k≤nf_i\overline{f}_k, 1 \leq i,k \leq n , are also linearly independent.

L. Lempert

Problem 8

Prove that the set of all linearly combinations (with real coefficients) of the system of polynomials {xn+xn2}n=0∞\{ x^n+x^{n^2} \}_{n=0}^{\infty} is dense in C[0,1]C[0,1] .

J. Szabados

Problem 9

Let DD be a convex subset of the nn -dimensional space, and suppose that D′D' is obtained from DD by applying a positive central dilatation and then a translation. Suppose also that the sum of the volumes of DD and D′D' is 11 , and D∩D′≠∅.D \cap D'\not= \emptyset . Determine the supremum of the volume of the convex hull of D∪D′D \cup D' taken for all such pairs of sets D,D′D,D' .

L. Fejes-Toth, E. Makai