MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
1965 Miklós Schweitzer
1965 Miklós Schweitzer
Part of
Miklós Schweitzer
Subcontests
(10)
10
1
Hide problems
Miklos Schweitzer 1965_10
A gambler plays the following coin-tossing game. He can bet an arbitrary positive amount of money. Then a fair coin is tossed, and the gambler wins or loses the amount he bet depending on the outcome. Our gambler, who starts playing with
x
x
x
forints, where
0
<
x
<
2
C
0<x<2C
0
<
x
<
2
C
, uses the following strategy: if at a given time his capital is
y
<
C
y<C
y
<
C
, he risks all of it; and if he has
y
>
C
y>C
y
>
C
, he only bets 2C\minus{}y. If he has exactly
2
C
2C
2
C
forints, he stops playing. Let
f
(
x
)
f(x)
f
(
x
)
be the probability that he reaches
2
C
2C
2
C
(before going bankrupt). Determine the value of
f
(
x
)
f(x)
f
(
x
)
.
9
1
Hide problems
Miklos Schweitzer 1965_9
Let
f
f
f
be a continuous, nonconstant, real function, and assume the existence of an
F
F
F
such that f(x\plus{}y)\equal{}F[f(x),f(y)] for all real
x
x
x
and
y
y
y
. Prove that
f
f
f
is strictly monotone.
8
1
Hide problems
Miklos Schweitzer 1965_8
Let the continuous functions f_n(x), \; n\equal{}1,2,3,..., be defined on the interval
[
a
,
b
]
[a,b]
[
a
,
b
]
such that every point of
[
a
,
b
]
[a,b]
[
a
,
b
]
is a root of f_n(x)\equal{}f_m(x) for some n \not\equal{} m. Prove that there exists a subinterval of
[
a
,
b
]
[a,b]
[
a
,
b
]
on which two of the functions are equal.
7
1
Hide problems
Miklos Schweitzer 1965_7
Prove that any uncountable subset of the Euclidean
n
n
n
-space contains an countable subset with the property that the distances between different pairs of points are different (that is, for any points P_1 \not\equal{} P_2 and Q_1\not\equal{} Q_2 of this subset, \overline{P_1P_2}\equal{}\overline{Q_1Q_2} implies either P_1\equal{}Q_1 and P_2\equal{}Q_2, or P_1\equal{}Q_2 and P_2\equal{}Q_1). Show that a similar statement is not valid if the Euclidean
n
n
n
-space is replaced with a (separable) Hilbert space.
6
1
Hide problems
Miklos Schweitzer 1965_6
Consider the radii of normal curvature of a surface at one of its points
P
0
P_0
P
0
in two conjugate direction (with respect to the Dupin indicatrix). Show that their sum does not depend on the choice of the conjugate directions. (We exclude the choice of asymptotic directions in the case of a hyperbolic point.)
5
1
Hide problems
Miklos Schweitzer 1965_5
Let A\equal{}A_1A_2A_3A_4 be a tetrahedron, and suppose that for each j \not\equal{} k, [A_j,A_{jk}] is a segment of length
ρ
\rho
ρ
extending from
A
j
A_j
A
j
in the direction of
A
k
A_k
A
k
. Let
p
j
p_j
p
j
be the intersection line of the planes
[
A
j
k
A
j
l
A
j
m
]
[A_{jk}A_{jl}A_{jm}]
[
A
jk
A
j
l
A
jm
]
and
[
A
k
A
l
A
m
]
[A_kA_lA_m]
[
A
k
A
l
A
m
]
. Show that there are infinitely many straight lines that intersect the straight lines
p
1
,
p
2
,
p
3
,
p
4
p_1,p_2,p_3,p_4
p
1
,
p
2
,
p
3
,
p
4
simultaneously.
4
1
Hide problems
Miklos Schweitzer 1965_4
The plane is divided into domains by
n
n
n
straight lines in general position, where
n
≥
3
n \geq 3
n
≥
3
. Determine the maximum and minimum possible number of angular domains among them. (We say that
n
n
n
lines are in general position if no two are parallel and no three are concurrent.)
3
1
Hide problems
Miklos Schweitzer 1965_3
Let a,b_0,b_1,b_2,...,b_{n\minus{}1} be complex numbers,
A
A
A
a complex square matrix of order
p
p
p
, and
E
E
E
the unit matrix of order
p
p
p
. Assuming that the eigenvalues of
A
A
A
are given, determine the eigenvalues of the matrix B\equal{}\begin{pmatrix} b_0E&b_1A&b_2A^2&\cdots&b_{n\minus{}1}A^{n\minus{}1} \\ ab_{n\minus{}1}A^{n\minus{}1}&b_0E&b_1A&\cdots&b_{n\minus{}2}A^{n\minus{}2}\\ ab_{n\minus{}2}A^{n\minus{}2}&ab_{n\minus{}1}A^{n\minus{}1}&b_0E&\cdots&b_{n\minus{}3}A^{n\minus{}3}\\ \vdots&\vdots&\vdots&\ddots&\vdots&\\ ab_1A&ab_2A^2&ab_3A^3&\cdots&b_0E \end{pmatrix}
2
1
Hide problems
Miklos Schweitzer 1965_2
Let
R
R
R
be a finite commutative ring. Prove that
R
R
R
has a multiplicative identity element
(
1
)
(1)
(
1
)
if and only if the annihilator of
R
R
R
is
0
0
0
(that is, aR\equal{}0, \;a\in R imply a\equal{}0).
1
1
Hide problems
Miklos Schweitzer 1965_1
Let
p
p
p
be a prime,
n
n
n
a natural number, and
S
S
S
a set of cardinality
p
n
p^n
p
n
. Let
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
P
<
/
s
p
a
n
>
<span class='latex-bold'>P</span>
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
P
<
/
s
p
an
>
be a family of partitions of
S
S
S
into nonempty parts of sizes divisible by
p
p
p
such that the intersection of any two parts that occur in any of the partitions has at most one element. How large can
∣
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
P
<
/
s
p
a
n
>
∣
|<span class='latex-bold'>P</span>|
∣
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
P
<
/
s
p
an
>
∣
be?