olymmath

SCHWEITZER 1959

Miklós Schweitzer Competition 1959.

Other problems

Problem 1

Let pnp_n be the nn th prime number. Prove that ∑n=2∞1npn−(n−1)pn−1=∞\sum_{n=2}^{\infty} \frac{1}{np_n-(n-1)p_{n-1}}= \infty (N.17)

Problem 2

Omit the vertices of a closed rectangle; the configuration obtained in such a way will be called a reduced rectangle. Prove tha the set-union of any system of reduced rectangles with parallel sides is equal to the union of countably many elements of the system. (St. 3)

Problem 3

**3.**Let GG be an arbitrary group, H1,…,HnH_1,\dots ,H_n some (not necessarily distinet) subgroup of GG and g1,…,gng_1, \dots , g_n elements of GG such that each element of GG belongs at least to one of the right cosets H1g1,…,HngnH_1 g_1, \dots , H_n g_n . Show that if, for any kk , the set-union of the cosets Higi(i=1,…,k−1,k+1,…,n)H_i g_i (i=1, \dots , k-1, k+1, \dots , n) differs from GG , then every Hk(k=1,…,n)H_k (k=1, \dots , n) is of finite index in GG . (A. 15)

Problem 4

Consider nn circles of radius 11 in the planea. Prove that at least one of the circles contains an are of length greater than 2πn\frac{2\pi}{n} not intersected by any other of these circles. (G. 4)

Problem 5

Denote by cnc_n the nn th positive integer which can be represented in the form cn=kl(k,l=2,3,… )c_n = k^{l} (k,l = 2,3, \dots ) . Prove that ∑n=1∞1cn−1=1\sum_{n=1}^{\infty}\frac{1}{c_n-1}=1 (N. 18)

Problem 6

Let TT be a one-to-one mapping of the unit square EE of the plane into itself. Suppose that TT and T−1T^{-1} are measure-preserving (i.e. if M⊆EM \subseteq E is a measurable set, then TMTM and T−1MT^{-1}M are also measurable and μ(M)=μ(TM)=μ(T−1M)\mu (M)= \mu (TM)= \mu (T^{-1}M) , where μ\mu denotes the Lebesgue measure) and, furthermore, that if Tx∈NTx \in N for almost all points xx of a measurable set N⊆EN \subseteq E , then either nn or E∖NE \setminus N is of measure 0. Prove that, for any measurable set A⊆EA \subseteq E , with μ(A)>0\mu (A)>0 , the function n(x)n(x) defined by n(x)={0,ifTkx∉A(k=1,2,… ),min⁡(k:Tkx∈A;k=1,2,… )otherwisen(x)=\begin{cases} 0, \text{if} T^k x \notin A (k=1, 2, \dots), \min (k: T^k x \in A; k=1,2, \dots ) &\text{otherwise} \end{cases} is measurable and ∫An(x)dμ(x)=1\int_{A}n(x) d\mu(x) =1 (R. 18)

Problem 7

Let (zn)n=1∞(z_n)_{n=1}^{\infty} be a sequence of complex numbers tending to zero. Prove that there exists a sequence (ϵn)n=1∞(\epsilon_n)_{n=1}^{\infty} (where ϵn=+1\epsilon_n = +1 or −1-1 ) such that the series ∑n=1∞ϵnzn\sum_{n=1}^{\infty} \epsilon_n z_n

is convergente. (F. 9)

Problem 8

An Oblique lattice-cubs is a lattice-cube of the three-dimensional fundamental lattice no edge of which is perpendicular to any coordinate axis. Prove that for any integer h=8n−1h= 8n-1 ( n=1,2,…n= 1, 2, \dots ) there existis an oblique lattice-cube with edges of length hh . Propose a method for finding such a cube. (N. 20)

Problem 9

Let f(z)=zn+a1zn−1+⋯+anf(z)= z^n +a_1 z^{n-1}+\dots + a_n be a polynomial over the field of the complex numbers and let EfE_f denote the closed (not necessarily connected) domain of complex numbers zz for which ∣f(z)∣≤1\mid f(z) \mid \leq 1 . Show that there exists a point z0∈Efz_0 \in E_f such that ∣f′(z0)∣≥n\mid f'(z_0) \mid \geq n . (F. 5)

Problem 10

Prove that if a graph with 2n+12n+1 vertices has at least 3n+13n+1 edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for 3n3n edges. (By a circuit, we mean a closed line which does not intersect itself.) (C. 5)