MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
2003 Miklós Schweitzer
6
6
Part of
2003 Miklós Schweitzer
Problems
(1)
Miklós Schweitzer 2003, Problem 6
Source: Miklós Schweitzer 2003
7/30/2016
Show that the recursion
n
=
x
n
(
x
n
−
1
+
x
n
+
x
n
+
1
)
n=x_n(x_{n-1}+x_n+x_{n+1})
n
=
x
n
(
x
n
−
1
+
x
n
+
x
n
+
1
)
,
n
=
1
,
2
,
…
n=1,2,\ldots
n
=
1
,
2
,
…
,
x
0
=
0
x_0=0
x
0
=
0
has exaclty one nonnegative solution.(translated by L. Erdős)
college contests
Miklos Schweitzer
Sequences
Recurrence