Scribd
Upload
8 views2 pages

Seqbo

The document presents a series of mathematical problems related to sequences of real numbers, each requiring proofs or investigations into their properties. Problems include proving inequalities, examining periodicity, and analyzing transformations of sequences. The problems are structured for integers and non-negative real numbers, focusing on various mathematical concepts and relationships.

Uploaded by

ghelichkhanimohammadreza55
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

Seqbo

The document presents a series of mathematical problems related to sequences of real numbers, each requiring proofs or investigations into their properties. Problems include proving inequalities, examining periodicity, and analyzing transformations of sequences. The problems are structured for integers and non-negative real numbers, focusing on various mathematical concepts and relationships.

Uploaded by

ghelichkhanimohammadreza55
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Sequence

1
Problem 1. Let n > 1 be an integer and let a1 , ..., an be real numbers such that a0 = 2
and
a + k2
ak+1 = a + k + for k = 0, .., n − 1
n
1
Prove that 1 − n < an < 1.
1
Problem 2. The sequence an is defined by a0 = 2 and

a2n
an+1 =
a2n − an + 1

for n ≥ 1. Prove that a1 + a2 + ... + an < 1 for all positive integer n.

Problem 3. Sequence of nonnegative real numbers (an )n≥1 satisfies

1
|am − an | ≥
m+n
for all distinct positive integer m, n. Prove that if a real number c is greater than an for
all n ≥ 1, then c ≥ 1.

Problem 4. Is there a sequence (an )n≥1 of real numbers such that an ∈ [0, 4] for all n and

1
|am − an | ≥
|m − n|

for all distinct positive integers m, n?


2
Problem 5. Let (xn )n≥1 be a sequence defined by x1 = 3 and

3xn + 2
xn+1 =
3 − 2xn
Is this sequence eventually periodic?
Problem 6. For a given real number a and a positive integer n, prove that:
i) There exists exactly one sequence of real numbers x0 , x1 , ..., xn , xn+1 such that x0 =
xn+1 = 0 and
1
(xi + xi+1 ) = xi + x3i − a3 , i = 0, 1, 2, ..., n.
2
ii) the sequence x0 , x1 , ..., xn , xn+1 in i) satisfies |xi | ≤ |a| Where i = 0, 1, ..., n + 1.

Problem 7. Let a1 , a2 , ..., an be a sequence of non-negative real numbers, not all zero. For
1 ≤ k ≤ n, let
ak−i+1 + ak−i+2 + ... + ak
mk = max
1≤i≤k i
Prove that for any α > 0, the number of integers k which satisfy mk > α is less than
a1 +...+an
α .

Problem 8. Let n ≥ 0. For every sequence of integers A = a0 , a1, a2 , ..., an satisfying


0 ≤ ai ≤ i, for i = 0, ..., n. define another sequence

t(A) = t(a0 ), t(a1 ), t(a2 ), ..., t(an )

by setting t(ai ) to be the number of terms in the sequence A that precede the term a,- and
are different from ai . Show that, starting from any sequence A as above, fewer than n
applications of the transformation t lead to a sequence B such that t(B) = B.

Problem 9. Let (xn )n≥1 be defined by the relations x1 = 1, and


xn n
xn+1 = + ,n ≥ 1
n xn

Prove that [x2n ] = n, for all n ≥ 4.

Problem 10. Let (an )n be a sequence of non-negative real numbers satisfying an+m ≤
an + am for all positive integers m, n. Prove that if n ≥ m, then
m
an ≤ mal + ( − 1)am .
n
Problem 11.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy