MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
1996 Miklós Schweitzer
1996 Miklós Schweitzer
Part of
Miklós Schweitzer
Subcontests
(9)
8
1
Hide problems
closed manifold
Prove that a simply connected, closed manifold (i.e., compact, no boundary) cannot contain a closed, smooth submanifold of codimension 1, with odd Euler characteristic.
7
1
Hide problems
analytic continuation
Construct a holomorphic function
f
(
z
)
=
∑
n
=
0
∞
a
n
z
n
f(z) = \sum \limits_{n = 0} ^ \infty a_n z^n
f
(
z
)
=
n
=
0
∑
∞
a
n
z
n
( | z | <1 ) in the unit circle that can be analytically continued to all points of the unit circle except one point, and for which the sequence
{
a
n
}
\{a_n\}
{
a
n
}
has two limit points,
∞
\infty
∞
and a finite value.
6
1
Hide problems
analysis
Let
{
a
n
}
\{a_n\}
{
a
n
}
be a bounded real sequence. (a) Prove that if X is a positive-measure subset of
R
\mathbb R
R
, then for almost all
x
∈
X
x\in X
x
∈
X
, there exist a subsequence
{
y
n
}
\{y_n\}
{
y
n
}
of X such that
∑
n
=
1
∞
(
n
(
y
n
−
x
)
−
a
n
)
=
1
\sum_{n=1}^\infty (n(y_n-x)-a_n)=1
n
=
1
∑
∞
(
n
(
y
n
−
x
)
−
a
n
)
=
1
(b) construct an unbounded sequence
{
a
n
}
\{a_n\}
{
a
n
}
for which the above equation is also true.
5
1
Hide problems
bijection between convergent and divergent series
Let K and D be the set of convergent and divergent series of positive terms respectively. Does there exist a bijection between K and D such that for all
∑
a
n
,
∑
b
n
∈
K
\sum a_n,\sum b_n\in K
∑
a
n
,
∑
b
n
∈
K
and
∑
a
n
′
,
∑
b
n
′
∈
D
\sum a_n',\sum b_n'\in D
∑
a
n
′
,
∑
b
n
′
∈
D
,
a
n
b
n
→
0
⟺
a
n
′
b
n
′
→
0
\frac{a_n}{b_n}\to 0\iff \frac{a_n'}{b_n'}\to 0
b
n
a
n
→
0
⟺
b
n
′
a
n
′
→
0
? Under the bijection,
∑
a
n
↔
∑
a
n
′
\sum a_n\leftrightarrow\sum a_n'
∑
a
n
↔
∑
a
n
′
and
∑
b
n
↔
∑
b
n
′
\sum b_n\leftrightarrow\sum b_n'
∑
b
n
↔
∑
b
n
′
.
1
1
Hide problems
weighted T2 space
Let X be a
κ
\kappa
κ
weighted compact
T
2
T_2
T
2
space. Prove that for every
ω
≤
λ
<
κ
\omega\leq\lambda<\kappa
ω
≤
λ
<
κ
, X has a continuous image of a
T
2
T_2
T
2
space of weight
λ
\lambda
λ
. (The weight of a space X is the smallest infinite cardinality of a base of X.)
2
1
Hide problems
spanning tree in geometric graph
A complete graph is in a plane such that no three of its vertices are collinear. The edges of the graph, which are straight segments connecting the vertices, are colored with two colors. Prove that there is a non-self-intersecting spanning tree consisting of edges of the same color.
4
1
Hide problems
number of subgroups of a certain index
Prove that in a finite group G the number of subgroups with index n is at most
∣
G
∣
2
log
2
n
| G |^{2 \log_2 n}
∣
G
∣
2
l
o
g
2
n
.
3
1
Hide problems
zero sum
Let
1
≤
a
1
<
a
2
<
.
.
.
<
a
2
n
≤
4
n
−
2
1\leq a_1 < a_2 <... < a_{2n} \leq 4n-2
1
≤
a
1
<
a
2
<
...
<
a
2
n
≤
4
n
−
2
be integers, such that their sum is even. Prove that for all sufficiently large n, there exist
ε
1
,
.
.
.
,
ε
2
n
=
±
1
\varepsilon_1 , ..., \varepsilon_{2n} = \pm1
ε
1
,
...
,
ε
2
n
=
±
1
such that
∑
ε
i
=
∑
ε
i
a
i
=
0
\sum\varepsilon_i = \sum\varepsilon_i a_i = 0
∑
ε
i
=
∑
ε
i
a
i
=
0
10
1
Hide problems
exchangeable random variables and order statistics
Let
Y
1
,
.
.
.
,
Y
n
Y_1 , ..., Y_n
Y
1
,
...
,
Y
n
be exchangeable random variables, ie for all permutations
π
\pi
π
, the distribution of
(
Y
π
(
1
)
,
…
,
Y
π
(
n
)
)
(Y_{\pi (1)}, \dots, Y_{\pi (n)} )
(
Y
π
(
1
)
,
…
,
Y
π
(
n
)
)
is equal to the distribution of
(
Y
1
,
.
.
.
,
Y
n
)
(Y_1 , ..., Y_n)
(
Y
1
,
...
,
Y
n
)
. Let
S
0
=
0
S_0 = 0
S
0
=
0
and
S
j
=
∑
i
=
1
j
Y
i
j
=
1
,
…
,
n
S_j = \sum_{i = 1}^j Y_i \qquad j = 1,\dots,n
S
j
=
i
=
1
∑
j
Y
i
j
=
1
,
…
,
n
Denote
S
(
0
)
,
.
.
.
,
S
(
n
)
S_{(0)} , ..., S_{(n)}
S
(
0
)
,
...
,
S
(
n
)
by the ordered statistics formed by the random variables
S
0
,
.
.
.
,
S
n
S_0 , ..., S_n
S
0
,
...
,
S
n
. Show that the distribution of
S
(
j
)
S_{(j)}
S
(
j
)
is equal to the distribution of
max
0
≤
i
≤
j
S
i
+
min
0
≤
i
≤
n
−
j
(
S
j
+
i
−
S
j
)
\max_{0 \le i \le j} S_i + \min_ {0 \le i \le n-j} (S_{j + i} -S_j)
max
0
≤
i
≤
j
S
i
+
min
0
≤
i
≤
n
−
j
(
S
j
+
i
−
S
j
)
.