MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
2020 Miklós Schweitzer
2020 Miklós Schweitzer
Part of
Miklós Schweitzer
Subcontests
(11)
11
1
Hide problems
inequality with continuous and smooth vector field
Given a real number
p
>
1
p>1
p
>
1
, a continuous function
h
:
[
0
,
∞
)
→
[
0
,
∞
)
h\colon [0,\infty)\to [0,\infty)
h
:
[
0
,
∞
)
→
[
0
,
∞
)
, and a smooth vector field
Y
:
R
n
→
R
n
Y\colon \mathbb{R}^n \to \mathbb{R}^n
Y
:
R
n
→
R
n
with
d
i
v
Y
=
0
\mathrm{div}~Y=0
div
Y
=
0
, prove the following inequality
∫
R
n
h
(
∣
x
∣
)
∣
x
∣
p
≤
∫
R
n
h
(
∣
x
∣
)
∣
x
+
Y
(
x
)
∣
p
.
\int_{\mathbb{R}^n}h(|x|)|x|^{p}\leq \int_{\mathbb{R}^{n}}h(|x|)|x+Y(x)|^{p}.
∫
R
n
h
(
∣
x
∣
)
∣
x
∣
p
≤
∫
R
n
h
(
∣
x
∣
)
∣
x
+
Y
(
x
)
∣
p
.
10
1
Hide problems
degree of irreducible in F_p divides the degree of the splitting field
Let
f
f
f
be a polynomial of degree
n
n
n
with integer coefficients and
p
p
p
a prime for which
f
f
f
, considered modulo
p
p
p
, is a degree-
k
k
k
irreducible polynomial over
F
p
\mathbb{F}_p
F
p
. Show that
k
k
k
divides the degree of the splitting field of
f
f
f
over
Q
\mathbb{Q}
Q
.
9
1
Hide problems
complex subset is not dependent
Let
D
⊆
C
D\subseteq \mathbb{C}
D
⊆
C
be a compact set with at least two elements and consider the space \Omega=\bigtimes_{i=1}^{\infty} D with the product topology. For any sequence
(
d
n
)
n
=
0
∞
∈
Ω
(d_n)_{n=0}^{\infty} \in \Omega
(
d
n
)
n
=
0
∞
∈
Ω
let
f
(
d
n
)
(
z
)
=
∑
n
=
0
∞
d
n
z
n
f_{(d_n)}(z)=\sum_{n=0}^{\infty}d_nz^n
f
(
d
n
)
(
z
)
=
∑
n
=
0
∞
d
n
z
n
, and for each point
ζ
∈
C
\zeta \in \mathbb{C}
ζ
∈
C
with
∣
ζ
∣
=
1
|\zeta|=1
∣
ζ
∣
=
1
we define
S
=
S
(
ζ
,
(
d
n
)
)
S=S(\zeta,(d_n))
S
=
S
(
ζ
,
(
d
n
))
to be the set of complex numbers
w
w
w
for which there exists a sequence
(
z
k
)
(z_k)
(
z
k
)
such that
∣
z
k
∣
<
1
|z_k|<1
∣
z
k
∣
<
1
,
z
k
→
ζ
z_k \to \zeta
z
k
→
ζ
, and
f
d
n
(
z
k
)
→
w
f_{d_n}(z_k) \to w
f
d
n
(
z
k
)
→
w
. Prove that on a residual set of
Ω
\Omega
Ω
, the set
S
S
S
does not depend on the choice of
ζ
\zeta
ζ
.
8
1
Hide problems
Functional equation on functions on F_p
Let
F
p
\mathbb{F}_{p}
F
p
denote the
p
p
p
-element field for a prime
p
>
3
p>3
p
>
3
and let
S
S
S
be the set of functions from
F
p
\mathbb{F}_{p}
F
p
to
F
p
\mathbb{F}_{p}
F
p
. Find all functions
D
:
S
→
S
D\colon S\to S
D
:
S
→
S
satisfying
D
(
f
∘
g
)
=
(
D
(
f
)
∘
g
)
⋅
D
(
g
)
D(f\circ g)=(D(f)\circ g)\cdot D(g)
D
(
f
∘
g
)
=
(
D
(
f
)
∘
g
)
⋅
D
(
g
)
for all
f
,
g
∈
S
f,g \in {S}
f
,
g
∈
S
. Here,
∘
\circ
∘
denotes the function composition, so
(
f
∘
g
)
(
x
)
(f\circ g)(x)
(
f
∘
g
)
(
x
)
is the function
f
(
g
(
x
)
)
f(g(x))
f
(
g
(
x
))
, and
⋅
\cdot
⋅
denotes multiplication, so
(
f
⋅
g
)
=
f
(
x
)
g
(
x
)
(f\cdot g)=f(x)g(x)
(
f
⋅
g
)
=
f
(
x
)
g
(
x
)
.
7
1
Hide problems
sequence bounded iff series converges
Let
p
(
n
)
≥
0
p(n)\geq 0
p
(
n
)
≥
0
for all positive integers
n
n
n
. Furthermore,
x
(
0
)
=
0
,
v
(
0
)
=
1
x(0)=0, v(0)=1
x
(
0
)
=
0
,
v
(
0
)
=
1
, and
x
(
n
)
=
x
(
n
−
1
)
+
v
(
n
−
1
)
,
v
(
n
)
=
v
(
n
−
1
)
−
p
(
n
)
x
(
n
)
(
n
=
1
,
2
,
…
)
.
x(n)=x(n-1)+v(n-1), \qquad v(n)=v(n-1)-p(n)x(n) \qquad (n=1,2,\dots).
x
(
n
)
=
x
(
n
−
1
)
+
v
(
n
−
1
)
,
v
(
n
)
=
v
(
n
−
1
)
−
p
(
n
)
x
(
n
)
(
n
=
1
,
2
,
…
)
.
Assume that
v
(
n
)
→
0
v(n)\to 0
v
(
n
)
→
0
in a decreasing manner as
n
→
∞
n \to \infty
n
→
∞
. Prove that the sequence
x
(
n
)
x(n)
x
(
n
)
is bounded if and only if
∑
n
=
1
∞
n
⋅
p
(
n
)
<
∞
\sum_{n=1}^{\infty}n\cdot p(n)<\infty
∑
n
=
1
∞
n
⋅
p
(
n
)
<
∞
.
6
1
Hide problems
existence of entire function under certain conditions
Does there exist an entire function
F
:
C
→
C
F \colon \mathbb{C}\to \mathbb{C}
F
:
C
→
C
such that
F
F
F
is not zero everywhere,
∣
F
(
z
)
∣
≤
e
∣
z
∣
|F(z)|\leq e^{|z|}
∣
F
(
z
)
∣
≤
e
∣
z
∣
for all
z
∈
C
z\in \mathbb{C}
z
∈
C
,
∣
F
(
i
y
)
∣
≤
1
|F(iy)|\leq 1
∣
F
(
i
y
)
∣
≤
1
for all
y
∈
R
y\in \mathbb{R}
y
∈
R
, and
F
F
F
has infinitely many real roots.
5
1
Hide problems
equivalence on nowhere dense compact subset of the real plane
Prove that for a nowhere dense, compact set
K
⊂
R
2
K\subset \mathbb{R}^2
K
⊂
R
2
the following are equivalent:(i)
K
=
⋃
i
=
1
∞
K
n
K=\bigcup_{i=1}^{\infty}K_n
K
=
⋃
i
=
1
∞
K
n
where
K
n
K_n
K
n
is a compact set with connected complement for all
n
n
n
.(ii)
K
K
K
does not have a nonempty closed subset
S
⊆
K
S\subseteq K
S
⊆
K
such that any neighborhood of any point in
S
S
S
contains a connected component of
R
2
∖
S
\mathbb{R}^2 \setminus S
R
2
∖
S
.
4
1
Hide problems
horizontal and vertical segments intersected by curves
Consider horizontal and vertical segments in the plane that may intersect each other. Let
n
n
n
denote their total number. Suppose that we have
m
m
m
curves starting from the origin that are pairwise disjoint except for their endpoints. Assume that each curve intersects exactly two of the segments, a different pair for each curve. Prove that
m
=
O
(
n
)
m=O(n)
m
=
O
(
n
)
.
3
1
Hide problems
matrix's transpose has has non-negative eigenvector with non-negative value
An
n
×
n
n\times n
n
×
n
matrix
A
A
A
with integer entries is called representative if, for any integer vector
v
\mathbf{v}
v
, there is a finite sequence
0
=
v
0
,
v
1
,
…
,
v
ℓ
=
v
0=\mathbf{v}_0,\mathbf{v}_1,\dots,\mathbf{v}_{\ell}=\mathbf{v}
0
=
v
0
,
v
1
,
…
,
v
ℓ
=
v
of integer vectors such that for each
0
≤
i
<
ℓ
0\leq i <\ell
0
≤
i
<
ℓ
, either
v
i
+
1
=
A
v
i
\mathbf{v}_{i+1}=A\mathbf{v}_{i}
v
i
+
1
=
A
v
i
or
v
i
+
1
−
v
i
\mathbf{v}_{i+1}-\mathbf{v}_i
v
i
+
1
−
v
i
is an element of the standard basis (i.e. one of its entries is
1
1
1
, the rest are all equal to
0
0
0
). Show that
A
A
A
is not representative if and only if
A
T
A^T
A
T
has a real eigenvector with all non-negative entries and non-negative eigenvalue.
2
1
Hide problems
periodic continuous implies sequence is dense
Prove that if
f
:
R
→
R
f\colon \mathbb{R} \to \mathbb{R}
f
:
R
→
R
is a continuous periodic function and
α
∈
R
\alpha \in \mathbb{R}
α
∈
R
is irrational, then the sequence
{
n
α
+
f
(
n
α
)
}
n
=
1
∞
\{n\alpha+f(n\alpha)\}_{n=1}^{\infty}
{
n
α
+
f
(
n
α
)
}
n
=
1
∞
modulo 1 is dense in
[
0
,
1
]
[0,1]
[
0
,
1
]
.
1
1
Hide problems
a function on sequences
We say that two sequences
x
,
y
:
N
→
N
x,y \colon \mathbb{N} \to \mathbb{N}
x
,
y
:
N
→
N
are completely different if
x
n
≠
y
n
x_n \neq y_n
x
n
=
y
n
holds for all
n
∈
N
n\in \mathbb{N}
n
∈
N
. Let
F
F
F
be a function assigning a natural number to every sequence of natural numbers such that
F
(
x
)
≠
F
(
y
)
F(x)\neq F(y)
F
(
x
)
=
F
(
y
)
for any pair of completely different sequences
x
x
x
,
y
y
y
, and for constant sequences we have
F
(
(
k
,
k
,
…
)
)
=
k
F \left((k,k,\dots)\right)=k
F
(
(
k
,
k
,
…
)
)
=
k
. Prove that there exists
n
∈
N
n\in \mathbb{N}
n
∈
N
such that
F
(
x
)
=
x
n
F(x)=x_{n}
F
(
x
)
=
x
n
for all sequences
x
x
x
.