You are on page 1of 14

SEQUENCE SEQUENCE

1. The sequence a
n
is defined as follows: a
1
= 1, a
n+1
= a
n
+ 1/a
n
for n 1. Prove that
a
100
> 14. (!" 1#$%&
'. The sequence a
1
, a
'
, ... , a
n
satisfies the followin( conditions: a
1
= 0, )a
i
) = )a
i*1
+ 1)
for i = ', +, ... , n. Prove that (a
1
+ a
'
+ ... + a
n
&/n *1/'. (!" 1#$%&
+. sequence of finite sets of ,ositive inte(ers is defined as follows. !
0
= -./, where
. > 1. Then (iven !
n
0ou derive !
n+1
10 ta2in( 2
'
and 2+1 for each ele.ent 2 of !
n
.
3or e4a.,le, if !
0
= -5/, then !
'
= -6, '$, +$, $'5/. !how that !
n
alwa0s has '
n
distinct ele.ents.(!" 1#6'&
4. a
1
and a
'
are ,ositive inte(ers less than 1000. 7efine a
n
= .in-)a
i
* a
8
) : 0 9 i 9 89n/.
!how that a
'1
=0. (!" 1#6$&
5. a
n
is an infinite sequence such that (a
n+1
* a
n
&/' tends to :ero. !how that a
n
tends to
:ero.(!"1#66&
$. ;iven a sequence a
1
, a
'
, ... , a
n
of ,ositive inte(ers. <et ! 1e the set of all su.s of
one or .ore .e.1ers of the sequence. !how that ! can 1e divided into n su1sets
such that the s.allest .e.1er of each su1set is at least half the lar(est .e.1er.
(!" 1#66&
6. !how that there is an infinite sequence of reals 4
1
, 4
'
, 4
+
, ... such that )4
n
) is 1ounded
and for an0 . > n, we have )4
.
* 4
n
) > 1/(. * n&.(!" 1#6%&
%. The real sequence 4
1
4
'
4
+
... satisfies 4
1
+ 4
4
/' + 4
#
/+ + 4
1$
/4 + ... + 4
=
/n
1 for ever0 square = = n
'
. !how that it also satisfies 4
1
+ 4
'
/' + 4
+
/+ + ... + 4
n
/n
+. (!"1#6#&
#. 7efine the sequence a
n
of ,ositive inte(ers as follows. a
1
= .. a
n+1
= a
n
,lus the
,roduct of the di(its of a
n
. 3or e4a.,le, if . = 5, we have 5, 10, 10, ... . >s there an
. for which the sequence is un1ounded?(!" 1#%0&
10. The sequence a
n
of ,ositive inte(ers is such that (1& a
n
n
+/'
for all n, and ('& .*n
divides 2
.
* 2
n
(for all . > n&. 3ind a
n
.(!" 1#%1&
11. The sequence a
n
is defined 10 a
1
= 1, a
'
= ', a
n+'
= a
n+1
+ a
n
. The sequence 1
n
is
defined 10 1
1
= ', 1
'
= 1, 1
n+'
= 1
n+1
+ 1
n
. @ow .an0 inte(ers 1elon( to 1oth
sequences?(!"1#%'&
1'. su1sequence of the sequence real sequence a
1
, a
'
, ... , a
n
is chosen so that (1& for
each i at least one and at .ost two of a
i
, a
i+1
, a
i+'
are chosen and ('& the su. of the
a1solute values of the nu.1ers in the su1sequence is at least 1/$

n
i
i
a
1
.(!"
1#%'&
1+. a
n
is the last di(it of A10
n/'
B. >s the sequence a
n
,eriodic? 1
n
is the last di(it of A'
n/'
B.
>s the sequence 1
n
,eriodic?(!" 1#%+&
14. The real sequence 4
n
is defined 10 4
1
= 1, 4
'
= 1, 4
n+'
= 4
n+1
'
* 4
n
/'. !how that the
sequence conver(es and find the li.it.(!" 1#%4&
15. The sequence a
1
, a
'
, a
+
, ... satisfies a
4n+1
= 1, a
4n++
= 0, a
'n
= a
n
. !how that it is not
,eriodic.(!" 1#%5&
1$. The sequence of inte(ers a
n
is (iven 10 a
0
= 0, a
n
= ,(a
n*1
&, where ,(4& is a
,ol0no.ial whose coefficients are all ,ositive inte(ers. !how that for an0 two
1
,ositive inte(ers ., 2 with (reatest co..on divisor d, the (reatest co..on divisor
of a
.
and a
2
is a
d
.(!" 1#%%&
16. sequence of ,ositive inte(ers is constructed as follows. >f the last di(it of a
n
is
(reater than 5, then a
n+1
is #a
n
. >f the last di(it of a
n
is 5 or less and a
n
has .ore than
one di(it, then a
n+1
is o1tained fro. a
n
10 deletin( the last di(it. >f a
n
has onl0 one
di(it, which is 5 or less, then the sequence ter.inates. Can we choose the first
.e.1er of the sequence so that it does not ter.inate?(!" 1##1&
1%. 7efine the sequence a
1
= 1, a
'
, a
+
, ... 10 a
n+1
= a
1
'
+ a
'

'
+ a
+
'
+ ... + a
n
'
+ n. !how
that 1 is the onl0 square in the sequence. (C>! 1##'&
1#. The sequence (a
n
& satisfies a
.+n
+ a
.*n
=
'
1
(a
'.
+a
'n
& for all .n 0. >f a
1
=1, find
a
1##5
. (Dussian 1##5&
'0. The sequence a
1
, a
'
, a
+
, ... of ,ositive inte(ers is deter.ined 10 its first two
.e.1ers and the rule a
n+'
= (a
n+1
+ a
n
&/(cd(a
n
, a
n+1
&. 3or which values of a
1
and a
'
is
it 1ounded?(Dussian 1###&
'1. The sequence a
1
, a
'
, .... , a
+#6'
includes each of the nu.1ers fro. 1 to 1#%$ twice.
Can the ter.s 1e rearran(ed so that there are 8ust n nu.1ers 1etween the two nEs?
(CFG 1#%$&
''. The inte(er sequence a
i
is defined 10 a
0
= ., a
1
= n, a
'
= 'n*.+', a
i++
=+(a
i+'
* a
i+1
&
+ a
i
. >t contains ar1itraril0 lon( sequences consecutive ter.s which are squares.
!how that ever0 ter. is a square.(CFG 1##'&
'+. 4
0
, 4
1
, ... , is a sequence of 1inar0 strin(s of len(th n. n is odd and 4
0
= 100...01.
4
.+1
is derived fro. 4
.
as follows: the 2th di(it in the strin( is 0 if the 2th and
2+1st di(its in the ,revious strin( are the sa.e, 1 otherwise. AThe n+1th di(it in a
strin( .eans the 1stB. !how that if 4
.
= 4
n
, then . is a .ulti,le of nB.(CFG 1##5&
'4. a
1
, a
'
, ... is a sequence of non*ne(ative inte(ers such that a
n+.
a
n
+ a
.
for all .,
n. !how that if = n, then a
n
+ a
=
na
1
+ =/n a
n
.(CFG 1##6&
'5. The sequence a
n
is defined 10 a
1
= 0, a
'
= 1, a
n
= (n a
n*1
+ n(n*1& a
n*'
+ (*1&
n*1
n&/' +
(*1&
n
. 3ind a
n
+ ' nC1 a
n*1
+ + nC' a
n*'
+ ... + n nC(n*1& a
1
, where nC. is the
1ino.ial coefficient nH/(.H (n*.&H &.(CFG '000&
'$. <et a
1
= 0, a
'n+1
= a
'n
= n. <et s(n& = a
1
+ a
'
+ ... + a
n
. 3ind a for.ula for s(n& and
show that s(. + n& = .n + s(. * n& for . > n.(CanFG 1#60&
'6. <et a
n
= 1/(n(n+1& &. (1& !how that 1/n = 1/(n+1& + a
n
. ('& !how that for an0 inte(er
n > 1 there are ,ositive inte(ers r 9 s such that 1/n = a
r
+ a
r+1
+ ... + a
s
.(CanFG
1#6+&
'%. 7efine the real sequence a
1
, a
'
, a
+
, ... 10 a
1
= 1/', n
'
a
n
= a
1
+ a
'
+ ... + a
n
. Ivaluate
a
n
. (CanFG 1#65&
'#. The real sequence 4
0
, 4
1
, 4
'
, ... is defined 10 4
0
= 1, 4
1
= ', n(n+1& 4
n+1
= n(n*1& 4
n
*
(n*'& 4
n*1
. 3ind 4
0
/4
1
+ 4
1
4
'
+ ... + 4
50
/4
51
.(CanFG 1#6$&
+0. The real sequence 4
1
, 4
'
, 4
+
, ... is defined 10 4
1
= 1 + 2, 4
n+1
= 1/4
n
+ 2, where 0 9 2
9 1. !how that ever0 ter. e4ceeds 1.(CanFG 1#66&
+1. 7efine the real sequence 4
1
, 4
'
, 4
+
, ... 10 4
1
= 2, where 1 9 2 9 ', and 4
n+1
= 4
n
*
4
n
'
/' + 1. !how that )4
n
* ' ) 9 1/'
n
for n > '.(CanFG 1#%5&
2
+'. The inte(er sequence a
1
, a
'
, a
+
, ... is defined 10 a
1
= +#, a
'
= 45, a
n+'
= a
n+1
'
* a
n
.
!how that infinitel0 .an0 ter.s of the sequence are divisi1le 10 1#%$.(CanFG
1#%$&
++. 7efine two inte(er sequences a
0
, a
1
, a
'
, ... and 1
0
, 1
1
, 1
'
, ... as follows. a
0
= 0, a
1
= 1,
a
n+'
= 4a
n+1
* a
n
, 1
0
= 1, 1
1
= ', 1
n+'
= 41
n+1
* 1
n
. !how that 1
n
'
= +a
n
'
+ 1.(CanFG
1#%%&
+4. sequence of ,ositive inte(ers a
1
, a
'
, a
+
, ... is defined as follows. a
1
= 1, a
'
= +, a
+
=
', a
4n
= 'a
'n
, a
4n+1
= 'a
'n
+ 1, a
4n+'
= 'a
'n+1
+ 1, a
4n++
= 'a
'n+1
. !how that the
sequence is a ,er.utation of the ,ositive inte(ers. (CanFG 1##+&
+5. !how that non*ne(ative inte(ers a 1 satisf0 (a
'
+ 1
'
& = n
'
(a1 + 1&, where n is a
,ositive inte(er, if the0 are consecutive ter.s in the sequence a
2
defined 10 a
0
= 0,
a
1
= n, a
2+1
= n
'
a
2
* a
2*1
. (CanFG 1##%&
+$. !how that in an0 sequence of '000 inte(ers each with a1solute value not e4ceedin(
1000 such that the sequence has su. 1, we can find a su1sequence of one or .ore
ter.s with :ero su..(CanFG '000&
+6. Iach .e.1er of the sequence a
1
, a
'
, ... , a
n
1elon(s to the set -1, ', ... , n*1/ and a
1
+ a
'
+ ... + a
n
9 'n. !how that we can find a su1sequence with su. n.(>rish 1#%%&
+%. The sequence of non:ero reals 4
1
, 4
'
, 4
+
, ... satisfies 4
n
= 4
n*'
4
n*1
/('4
n*'
* 4
n*1
& for all n
> '. 3or which (4
1
, 4
'
& does the sequence contain infinitel0 .an0 inte(ral ter.s?
(>rish 1#%%&
+#. The sequence a
1
, a
'
, a
+
, ... is defined 10 a
1
= 1, a
'n
= a
n
, a
'n+1
= a
'n
+ 1. 3ind the
lar(est value in a
1
, a
'
, ... , a
1#%#
and the nu.1er of ti.es it occurs.(>rish 1#%#&
40. The sequence a
1
, a
'
, a
+
, ... is defined 10 a
1
= 1, a
'n
= a
n
, a
'n+1
= a
'n
+ 1. 3ind the
lar(est value in a
1
, a
'
, ... , a
1#%#
and the nu.1er of ti.es it occurs.(>rish '00'&
41. The sequence

1
/ -
n
n
x
is defined as: 4
1
=1, 4
n+1
=4
n
'
* +4
n
+ 4,n= 1,',+,...
a& Prove that

1
/ -
n
n
x
is .onotone increasin( and un1ounded.
1& Prove that the sequence

1
/ -
n
n
y
defined as 0
n
= 1/(4
1
*1& +....+1/(4
n
*1& is
conver(ent and find its li.it (Jun(ari 1##6*Pro1le. in winter&
4'. <et

1
/ -
n
n
x
1e a sequence of inte(er nu.1er such that their dice.al
re,resentations consist of even di(its( a
1
=', a
'
=4, a
+
=$,...&. 3ind all inte(er nu.1er
m such that a
.
= 1'..(Jun(ari 1##% * Pro1le. in winter&
4+. Prove that for ever0 ,ositive nu.1er
a
the sequence

1
/ -
n
n
x
such that 4
1
=1, 4
'
=a,
' + n
x
=
+
'
1
n
n
x x
+
,n 1 is conver(ent and find its li.it.(Jun(ari '000*
Pro1le.11.1&
44. ;iven the sequence
n
x
=
a
1
'
+ n , n=1,',.....where
a
is a real nu.1er:
a& 3ind the values of a such that the sequence

1
/ -
n
n
x
is conver(ent.
1& 3ind the values of a such that the sequence

1
/ -
n
n
x
is .onotone increasin(.
(Jun(ari 1###*Pro in winter&
45. <et

1
/ -
n
n
x
1e a sequence such that 4
1
=4+, 4
'
=14',
' + n
x
= +
1 + n
x
+
n
x
,n 1
.Prove that:
a&
n
x
and
1 + n
x
are relativel0 ,ri.e for all n.
3
1& for ever0 natural nu.1er m there e4its infinitel0 .an0 natural nu.1er n such
that
n
x
*1 and
1 + n
x
*1 1oth divisi1le 10 m. (Jun(ari '000*Pro+ third round&
4$. sequence is a
1
, a
'
, a
+
,.... is defined 10 a
1
= 2, a
'
= 52*' and a
n+'
= +a
n+1
* 'a
n
, n 1,
where 2 is a real nu.1er
a&3ind all values of 2, such that the sequence

1
/ -
n
n
a
is conver(ent.
1&Prove that if 2=1 then:
1
1
]
1

+ +

+
+
+
+
1
1
'
1
'
1
% 6
n n
n n
n
n
a a
a a a
a ,n 1, where
[ ] x
denoted the
inte(er ,art of 4.(Jun(ari '001,'*4&
46. 7efine the sequence a
1
, a
'
, a
+
, ... 10 a
1
= 1, a
n
= a
n*1
* n if a
n*1
> n, a
n*1
+ n if a
n*1
n.
<et ! 1e the set of n such that a
n
= 1##+. !how that ! is infinite. 3ind the s.allest
.e.1er of !. >f the ele.ent of ! are written in ascendin( order show that the ratio
of consecutive ter.s tends to +.(>FG !@GDT<>!T 1##+&
4%. The sequence 4
0
, 4
1
, 4
'
, ... is defined 10 4
0
= 1##4, 4
n+1
= 4
n
'
/(4
n
+ 1&. !how that
A4
n
B = 1##4 * n for 0 n ##%.(>FG !@GDT<>!T 1##4&
4#. 7efine the sequences a
n
, 1
n
, c
n
as follows. a
0
= 2, 1
0
= 4, c
0
= 1. >f a
n
is even then
a
n+1
= a
n
/', 1
n+1
= '1
n
, c
n+1
= c
n
. >f a
n
is odd, then a
n+1
= a
n
* 1
n
/' * c
n
, 1
n+1
= 1
n
, c
n+1
=
1
n
+ c
n
. 3ind the nu.1er of ,ositive inte(ers 2 9 1##5 such that so.e a
n
= 0. (>FG
!@GDT<>!T 1##4&
50. 7efine the sequence a
1
, a
'
, a
+
, ... as follows. a
1
and a
'
are co,ri.e ,ositive inte(ers
and a
n+'
= a
n+1
a
n
+ 1. !how that for ever0 . > 1 there is an n > . such that a
.
.
divides a
n
n
. >s it true that a
1
.ust divide a
n
n
for so.e n > 1?(>FG !@GDT<>!T
1##4&
51. 3ind a sequence f(1&, f('&, f(+&, ... of non*ne(ative inte(ers such that 0 occurs in the
sequence, all ,ositive inte(ers occur in the sequence infinitel0 often, and f( f(n
1$+
& &
= f( f(n& & + f( f(+$1& &.(>FG !@GDT<>!T 1##5&
5'. ;iven a > ',define the sequence a
0
,a
1
,a
'
, ...10 a
0
= 1, a
1
= a, a
n+'
= a
n+1
(a
n+1
'
/a
n
'
*'&.
!how that 1/a
0
+ 1/a
1
+ 1/a
'
+ ... + 1/a
n
9 ' + a * (a
'
* 4&
1/'
.(>FG !@GDT<>!T
1##$&
5+. The sequence a
1
, a
'
, a
+
, ... is defined 10 a
1
= 0 and a
4n
= a
'n
+ 1, a
4n+1
= a
'n
* 1, a
4n+'
=
a
'n+1
* 1, a
4n++
= a
'n+1
+ 1. 3ind the .a4i.u. and .ini.u. values of a
n
for n = 1, ',
... , 1##$ and the values of n at which the0 are attained. @ow .an0 ter.s a
n
for n =
1, ', ... , 1##$ are 0? (>FG !@GDT<>!T 1##$&
54. finite sequence of inte(ers a
0
, a
1
, ... , a
n
is called quadratic if )a
1
* a
0
) = 1
'
, )a
'
* a
1
)
= '
'
,..., )a
n
* a
n*1
) = n
'
. !how that an0 two inte(ers h, 2 can 1e lin2ed 10 a quadratic
sequence (in other words for so.e n we can find a quadratic sequence a
i
with a
0
=
h, a
n
= 2&. 3ind the shortest quadratic sequence lin2in( 0 and 1##$. (>FG
!@GDT<>!T 1##$&
55. The sequences D
n
are defined as follows. D
1
= (1&. >f D
n
= (a
1
, a
'
, ... , a
.
&, then D
n+1
= (1, ', ... , a
1
, 1, ', ... , a
'
, 1, ', ... , 1, ', ... , a
.
, n+1&. 3or e4a.,le, D
'
= (1, '&, D
+
=
(1, 1, ', +&, D
4
= (1, 1, 1, ', 1, ', +, 4&. !how that for n > 1, the 2th ter. fro. the
left in D
n
is 1 iff the 2th ter. fro. the ri(ht is not 1.(>FG !@GDT<>!T 1##6&
4
5$. The sequence a
1
, a
'
, a
+
, ... is defined as follows. a
1
= 1. a
n
is the s.allest inte(er
(reater than a
n*1
such that we cannot find 1 i, 8, 2 n (not necessaril0 distinct&
such that a
i
+ a
8
= +a
2
. 3ind a
1##%
. (>FG !@GDT<>!T 1##%&
56. The sequence 0 a
0
9 a
1
9 a
'
9 ... is such that ever0 non*ne(ative inte(er can 1e
uniquel0 e4,ressed as a
i
+ 'a
8
+ 4a
2
(where i, 8, 2 are not necessaril0 distinct&. 3ind
a
1##%
. (>FG !@GDT<>!T 1##%&
5%. <et , > + 1e a ,ri.e. <et h 1e the nu.1er of sequences a
1
, a
'
, ... , a
,*1
such that a
1
+
'a
'
+ +a
+
+ ... + (,*1&a
,*1
is divisi1le 10 , and each a
i
is 0, 1 or '. <et 2 1e defined
si.ilarl0 e4ce,t that each a
i
is 0, 1 or +. !how that h 2 with equalit0 if , = 5.
(>FG !@GDT<>!T 1###&
5#. !how that there e4ist two strictl0 increasin( sequences a
1
, a
'
, a
+
, ... and 1
1
, 1
'
, 1
+
, ...
such that a
n
(a
n
+ 1& divides 1
n
'
+ 1 for each n.(>FG !@GDT<>!T 1###&
$0. 0 = a
0
9 a
1
9 a
'
9 ... and 0 = 1
0
9 1
1
9 1
'
9 ... are sequences of real nu.1ers such
that: (1& if a
i
+ a
8
+ a
2
= a
r
+ a
s
+ a
t
, then (i, 8, 2& is a ,er.utation of (r, s, t&K and ('&
a ,ositive real 4 can 1e re,resented as 4 = a
8
* a
i
iff it can 1e re,resented as 1
.
* 1
n
.
Prove that a
2
= 1
2
for all 2. (>FG !@GDT<>!T '000&
$1. 3ind all finite sequences a
0
, a
1
, a
'
, ... , a
n
such that a
.
equals the nu.1er of ti.es
that . a,,ears in the sequence.(>FG !@GDT<>!T '001&
$'. The sequence a
n
is defined 10 a
1
= 11
11
, a
'
= 1'
1'
, a
+
= 1+
1+
, and a
n++
= )a
n+'
* a
n+1
) + )
a
n+1
* a
n
). 3ind a
n
, where n = 14
14
.(>FG !@GDT<>!T '001&
63. The infinite real sequence 4
1
, 4
'
, 4
+
, ... satisfies )4
i
* 4
8
) 1/(i + 8& for all
unequal i, 8. !how that if all 4
i
lie in the interval A0, cB, then c 1.(>FG
!@GDT<>!T '00'&
$4. The sequence a
n
is defined 10 a
1
= a
'
= 1, a
n+'
= a
n+1
+ 'a
n
. The sequence 1
n
is
defined 10 1
1
= 1, 1
'
= 6, 1
n+'
= '1
n+1
+ +1
n
. !how that the onl0 inte(er in 1oth
sequences is 1. ("!FG 1#6+&
$5. a
1
, a
'
, ... , a
n
is an ar1itrar0 sequence of ,ositive inte(ers. .e.1er of the
sequence is ,ic2ed at rando.. >ts value is a. nother .e.1er is ,ic2ed at rando.,
inde,endentl0 of the first. >ts value is 1. Then a third, value c. !how that the
,ro1a1ilit0 that a + 1 + c is divisi1le 10 + is at least 1/4.("!FG 1#6#&
$$. 0 9 a
1
a
'
a
+
... is an un1ounded sequence of inte(ers. <et 1
n
= . if a
.
is
the first .e.1er of the sequence to equal or e4ceed n. ;iven that a
1#
= %5, what is
the .a4i.u. ,ossi1le value of a
1
+ a
'
+ ... + a
1#
+ 1
1
+ 1
'
+ ... + 1
%5
?("!FG
1#%5&
67. a
1
, a
'
, ... , a
n
is a sequence of 0s and 1s. T is the nu.1er of tri,les (a
i
, a
8
, a
2
&
with i 9 8 9 2 which are not equal to (0, 1, 0& or (1, 0, 1&. 3or 1 i n, f(i& is the
nu.1er of 8 9 i with a
8
= a
i
,lus the nu.1er of 8 > i with a
8
a
i
. !how that T = f(1&
(f(1& * 1&/' + f('& (f('& * 1&/' + ... + f(n& (f(n& * 1&/'. >f n is odd, what is the s.allest
value of T?("!FG 1#%6&
$%. The sequence a
n
of odd ,ositive inte(ers is defined as follows: a
1
= r, a
'
= s, and a
n
is the (reatest odd divisor of a
n*1
+ a
n*'
. !how that, for sufficientl0 lar(e n, a
n
is
constant and find this constant (in ter.s of r and s&.("!FG 1##+&
$#. The sequence a
1
, a
'
, ... , a
##
has a
1
= a
+
= a
5
= ... = a
#6
= 1, a
'
= a
4
= a
$
= ... = a
#%
= ',
and a
##
= +. Le inter,ret su1scri,ts (reater than ## 10 su1tractin( ##, so that a
100
.eans a
1
etc. n allowed .ove is to chan(e the value of an0 one of the a
n
to
5
another .e.1er of -1, ', +/ different fro. its two nei(h1ors, a
n*1
and a
n+1
. >s there
a sequence of allowed .oves which results in a
.
= a
.+'
= ... = a
.+#$
= 1, a
.+1
= a
.++
= ... = a
.+#5
= ', a
.+#6
= +, a
n+#%
= ' for so.e .? A!o if . = 1, we have 8ust
interchan(ed the values of a
#%
and a
##
.B("!FG 1##4&
70. 4
i
is a infinite sequence of ,ositive reals such that for all n, 4
1
+ 4
'
+ ... + 4
n
n
. !how that 4
1
'
+ 4
'
'
+ ... + 4
n
'
> (1 + 1/' + 1/+ + ... + 1/n& / 4 for all n.
("!FG 1##4&
61. a
0
, a
1
, a
'
, ... is an infinite sequence of inte(ers such that a
n
* a
.
is divisi1le 10 n * .
for all (unequal& n and .. 3or so.e ,ol0no.ial ,(4& we have ,(n& > )a
n
) for all n.
!how that there is a ,ol0no.ial q(4& such that q(n& = a
n
for all n.("!FG 1##5&
6'. t0,e 1 sequence is a sequence with each ter. 0 or 1 which does not have 0, 1, 0
as consecutive ter.s. t0,e ' sequence is a sequence with each ter. 0 or 1 which
does not have 0, 0, 1, 1 or 1, 1, 0, 0 as consecutive ter.s. !how that there are twice
as .an0 t0,e ' sequences of len(th n+1 as t0,e 1 sequences of len(th n.("!FG
1##$&
6+. <et ,
n
1e the nth ,ri.e. <et 0 9 a 9 1 1e a real. 7efine the sequence 4
n
10 4
0
= a, 4
n
= the fractional ,art of ,
n
/4
n*1
if 4
n
M 0, or 0 if 4
n*1
= 0. 3ind all a for which the
sequence is eventuall0 :ero.("!FG 1##6&
64. sequence of ,ol0(ons is derived as follows. The first ,ol0(on is a re(ular
he4a(on of area 1. Thereafter each ,ol0(on is derived fro. its ,redecessor 10
8oinin( two ad8acent ed(e .id,oints and cuttin( off the corner. !how that all the
,ol0(ons have area (reater than 1/+.("!FG 1##6&
75. The sequence of non*ne(ative inte(ers c
1
, c
'
, ... , c
1##6
satisfies c
1
0 and c
.
+ c
n
c
.+n
c
.
+ c
n
+ 1 for all ., n > 0 with . + n 9 1##%. !how that there is a
real 2 such that c
n
= An2B for 1 n 1##6. ("!FG 1##6&
6$. 7efine the sequence a
n
, 10 a
1
= 0, a
'
= 1,a
+
= ',a
4
= +, and a
'n
= a
'n*5
+ '
n
, a
'n+1
= a
'n
+ '
n*1
. !how that a
'n
= A16/6 '
n*1
B * 1, a
'n*1
= A1'/6 '
n*1
B * 1.(JFG 1#6'&
66. 7efine sequences of inte(ers 10 ,
1
= ', q
1
= 1, r
1
= 5, s
1
= +, ,
n+1
= ,
n
'
+ + q
n
'
, q
n+1
=
' ,
n
q
n
, r
n
= ,
n
+ + q
n
, s
n
= ,
n
+ q
n
. !how that ,
n
/q
n
> + > r
n
/s
n
and that ,
n
/q
n
differs
fro. + 10 less than s
n
/(' r
n
q
n
'
&.(JFG 1#6'&
6%. !how that there is a unique sequence a
1
, a
'
, a
+
, ... such that a
1
= 1, a
'
> 1, a
n+1
a
n*1
=
a
n
+
+ 1, and all ter.s are inte(ral.(JFG 1#6%&
79. 3ind all real a
0
such that the sequence a
0
, a
1
, a
'
, ... defined 10 a
n+1
= '
n
* +a
n
has a
n+1
> a
n
for all n 0.(JFG 1#%0&
%0. The sequence u
0
, u
1
, u
'
, ... is defined 10 u
0
= ', u
1
= 5, u
n+1
u
n*1
* u
n
'
= $
n*1
. !how that
all ter.s of the sequence are inte(ral. (JFG 1#%1&
%1. The sequence ,
1
, ,
'
, ,
+
, ... is defined as follows. ,
1
= '. ,
n+1
is the largest ,ri.e
divisor of ,
1
,
'
... ,
n
+ 1. !how that 5 does not occur in the sequence.(JFG 1#%'&
82. <et - 4 / denote the nearest inte(er to 4, so that 4 * 1/' - 4 / 9 4 + 1/'.
7efine the sequence u
1
, u
'
, u
+
, ... 10 u
1
= 1. u
n+1
= u
n
+ - u
n
' /. !o, for e4a.,le, u
'
= ', u
+
= 5, u
+
= 1'. 3ind the units di(it of u
1#%5
.(JFG 1#%5&
%+. The real sequence 4
1
, 4
1
, 4
'
, ... is defined 10 4
0
= 1, 4
n+1
= (+4
n
+ 4 5
'

n
x &/'. !how
that all the ter.s are inte(ers.(JFG '00'&
6
%4. sequence of values in the ran(e 0, 1, ', ... , 2*1 is defined as follows: a
1
= 1, a
n
=
a
n*1
+ n (.od 2&. 3or which 2 does the sequence assu.e all 2 ,ossi1le values?
(PFG 1##1&
%5. a
1
, a
'
, a
+
, ... a
n
is a sequence of non*:ero inte(ers such that the su. of an0 6
consecutive ter.s is ,ositive and the su. of an0 11 consecutive ter.s is ne(ative.
Lhat is the lar(est ,ossi1le value for n?(PFG 1##'&
%$. 3ind all real sequences 4
1
, 4
'
, ... , 4
1##5
which satisf0 '
+ 1 n x
n 4
n+1
* n + 1 for n
= 1, ', ... , 1##4, and '
1##4
1##5
x
4
1
+ 1.(PFG 1##5&
%6. 3ind the s.allest n such that an0 sequence a
1
, a
'
, ... , a
n
whose values are relativel0
,ri.e square*free inte(ers 1etween ' and 1##5 .ust contain a ,ri.e. An inte(er
is square*free if it is not divisi1le 10 an0 square e4ce,t 1.B(PFG 1##5&
%%. P
1
and P
+
are fi4ed ,oints. P
'
lies on the line ,er,endicular to P
1
P
+
throu(h P
+
. The
sequence P
4
, P
5
, P
$
, ... is defined inductivel0 as follows: P
n+1
is the foot of the
,er,endicular fro. P
n
to P
n*1
P
n*'
. !how that the sequence conver(es to a ,oint P
(whose ,osition de,ends on P
'
&. Lhat is the locus of P as P
'
varies?(PFG 1##6&
%#. The inte(ers r, s are non*:ero and 2 is a ,ositive real. The sequence a
n
is defined 10
a
1
= r, a
'
= s, a
n+'
= (a
n+1
'
+ 2&/a
n
. !how that all ter.s of the sequence are inte(ers iff
(r
'
+ s
'
+ 2&/(rs& is an inte(er.(Jal2an 1#%$&
#0. 4
n
is the sequence 51, 5+, 56, $5, ... , '
n
+ 4#, ... 3ind all n such that 4
n
and 4
n+1
are
each the ,roduct of 8ust two distinct ,ri.es with the sa.e difference.(Jal2an 1#%%&
#1. The sequence u
n
is defined 10 u
1
= 1, u
'
= +, u
n
= (n+1& u
n*1
* n u
n*'
. Lhich
.e.1ers of the sequence which are divisi1le 10 11? (Jal2an 1##0&
#'. 7efine a
n
10 a
+
= (' + +&/(1 + $&, a
n
= (a
n*1
+ n&/(1 + n a
n*1
&. 3ind a
1##5
. (Jal2an
1##5&
93. 0 = a
1
, a
'
, a
+
, ... is a non*decreasin(, un1ounded sequence of non*ne(ative
inte(ers. <et the nu.1er of .e.1ers of the sequence not e4ceedin( n 1e 1
n
. Prove
that (4
0
+ 4
1
+ ... + 4
.
&(0
0
+ 0
1
+ ... + 0
n
& (. + 1&(n + 1&.(Jal2an 1###&
#4. The sequence a
n
is defined 10 a
1
= '0, a
'
= +0, a
n+1
= +a
n
* a
n*1
. 3ind all n for which
5a
n+1
a
n
+ 1 is a square.(Jal2an '00'&
95. a
i
and 1
i
are real, and !
1

a
i
'
and !
1

1
i
'
conver(e. Prove that !
1

(a
i
* 1
i
&
,
conver(es for , '.(Putna. 1#40&
#$. The sequence a
n
of real nu.1ers satisfies a
n+1
= 1/(' * a
n
&. !how that
n
li.
a
n
= 1.
(Putna. 1#46&
#6. a
n
is a sequence of ,ositive reals decreasin( .onotonicall0 to :ero. 1
n
is defined 10
1
n
= a
n
* 'a
n+1
+ a
n+'
and all 1
n
are non*ne(ative. Prove that 1
1
+ '1
'
+ +1
+
+ ... = a
1
.
(Putna. 1#4%&
98. a
n
is a sequence of ,ositive reals. !how that li. su,
n
((a
1
+ a
n+1
&/a
n
&
n

e.
(Puta. 1#4#&
##. The sequences a
n
, 1
n
, c
n
of ,ositive reals satisf0: (1& a
1
+ 1
1
+ c
1
= 1K ('& a
n+1
= a
n
'
+
'1
n
c
n
, 1
n+1
= 1
n
'
+ 'c
n
a
n
, c
n+1
= c
n
'
+ 'a
n
1
n
. !how that each of the sequences
conver(es and find their li.its. (Putna. 1#46&
100. The sequence a
n
is defined 10 a
0
= , a
1
= , a
n+1
= a
n
+ (a
n*1
* a
n
&/('n&. 3ind
n
li.
a
n
. (Putna. 1#50&
7
101. <et a
n
= !
1
n
(*1&
i+1
/i. ssu.e that
n
li.
a
n
= 2. Dearran(e the ter.s 10 ta2in(
two ,ositive ter.s, then one ne(ative ter., then another two ,ositive ter.s, then
another ne(ative ter. and so on. <et 1
n
1e the su. of the first n ter.s of the
rearran(ed series. ssu.e that
n
li.
1
n
= h. !how that 1
+n
= a
4n
+ a
'n
/', and hence
that h 2.(Putna. 1#54&
10'. <et a 1e a ,ositive real. <et a
n
= !
1
n
(a/n + i/n&
n
. !how that
n
li.
a
n
N(e
a
,
e
a+1
&. (Putna. 1#54&
103. a
n
is a sequence of .onotonicall0 decreasin( ,ositive ter.s such that a
n
conver(es. ! is the set of all 1
n
, where 1
n
is a su1sequence of a
n
. !how that ! is
an interval iff a
n*1

n

a
i
for all n.(Putna. 1#55&
104. The sequence a
n
is defined 10 a
1
= ', a
n+1
= a
n
'
* a
n
+ 1. !how that an0 ,air of
values in the sequence are relativel0 ,ri.e and that
n
a
1
N = 1.(Putna. 1#5$&
105. 7efine a
n
10 a
1
= ln a,a
'
= ln(a * a
1
&,a
n+1
= a
n
+ ln(a * a
n
&. !how that
n
li.
a
n
=
a*1. (Putna. 1#56&
10$. The sequence a
n
is defined 10 its initial value a
1
, and a
n+1
= a
n
(' * 2 a
n
&. 3or
what real a
1
does the sequence conver(e to 1/2?(Putna. 1#56&
107. sequence of nu.1ers a
i
A0, 1B is chosen at rando.. !how that the
e4,ected value of n, where !
1
n
a
i
> 1, !
1
n*1
a
i
1 is e.(Putna. 1#5%&
10%. a and 1 are ,ositive irrational nu.1ers satisf0in( 1/a + 1/1 = 1. <et a
n
= An
aB and 1
n
= An 1B, for n = 1, ', +, ... . !how that the sequences a
n
and 1
n
are dis8oint
and that ever0 ,ositive inte(er 1elon(s to one or the other.(Putna. 1#5#&
10#. The sequence a
1
, a
'
, a
+
, ... of ,ositive inte(ers is strictl0 .onotonic
increasin(, a
'
= ' and a
.n
= a
.
a
n
for ., n relativel0 ,ri.e. !how that a
n
= n.
(Putna. 1#$+&
110. !how that for an0 sequence of ,ositive reals, a
n
, we have li.
n
su,
1 1
1
1

,
_

+
+
n
n
a
a
n
. !how that we can find a sequence where equalit0 holds.
(Putna. 1#$+&
111. The series

1 n
a
n
of non*ne(ative ter.s conver(es and a
i
9= 100a
n
for i = n,
n + 1, n + ', ... , 'n. !how that
n
li.
na
n
= 0.(Putna. 1#$+&
11'. The sequence of inte(ers u
n
is 1ounded and satisfies u
n
= (u
n*1
+ u
n*'
+ u
n*+
u
n*
4
&/(u
n*1
u
n*'
+ u
n*+
+ u
n*4
&. !how that it is ,eriodic for sufficientl0 lar(e n.(Putna.
1#$4&
113. a
n
are ,ositive inte(ers such that 1/a
n
conver(es. 1
n
is the nu.1er of a
n
which are 9= n. Prove li. 1
n
/n = 0.(Putna. 1#$4&
114. <et a
n
1e a strictl0 .onotonic increasin( sequence of ,ositive inte(ers. <et
1
n
1e the least co..on .ulti,le of a
1
, a
'
, ... , a
n
. Prove that 1/1
n
conver(es.
(,utna. 1#$4&
8
115.

1
/ -
n
n
a
is an infinite sequence of real nu.1ers. <et 1
n
= 1/n

n
i
i
ia
1
& e4,(
.
Prove that 1
1
, 1
'
, 1
+
, 1
4
, ... conver(es to 2 if 1
1
, 1
4
, 1
#
, 1
1$
, ... conver(es to 2.
(Putna.1#$5&
116. 7efine the sequence

1
/ -
n
n
a
10 a
1
(0, 1&, and a
n+1
= a
n
(1 * a
n
&. !how that
n
li.
na
n
= 1. (Putna. 1#$$&
116. a
n
is a sequence of ,ositive reals such that

1 n
1/a
n
conver(es. <et s
n
=

n
i
i
a
1
. Prove that

1 n
n
'
a
n
/s
n
'
conver(es.(Putna. 1#$$&
11%. <et u
n
1e the nu.1er of s0..etric n 4 n .atrices whose ele.ents are all 0
or 1, with e4actl0 one 1 in each row. Ta2e u
0
= 1. Prove u
n+1
= u
n
+ n u
n*1
and N

0 n
u
n
4
n
/nH = e
f(4&
, where f(4& = 4 + (1/'& 4
'
.(Putna. 1#$6&
11#. Le are (iven a sequence a
1
, a
'
, ... , a
n
. Iach a
i
can ta2e the values 0 or 1.
>nitiall0, all a
i
= 0. Le now successivel0 carr0 out ste,s 1, ', ... , n. t ste, . we
chan(e the value of a
i
for those i which are a .ulti,le of .. !how that after ste, n,
a
i
= 1 if i is a square. 7evise a si.ilar sche.e to (ive a
i
= 1 if i is twice a square.
(Putna. 1#$6&
1'0. The sequence a
1
, a
'
, a
+
, ... satisfies a
1
a
'
= 1, a
'
a
+
= ', a
+
a
4
= +, a
4
a
5
= 4, ... .
lso,
1
li.
n
a
n
/a
n+1
= 1. Prove that a
1
=

'
.(Putna. 1#$#&
1'1. The sequence a
i
, i = 1, ', +, ... is strictl0 .onotonic increasin( and the su.
of its inverses conver(es. <et f(4& = the lar(est i such that a
i
9 4. Prove that f(4&/4
tends to 0 as 4 tends to infinit0.(Putna. 1#$#&
1''. The real sequence a
1
, a
'
, a
+
, ... has the ,ro,ert0 that
1
li.
n
(a
n+'
* a
n
& = 0.
Prove that
1
li.
n
(a
n+1
* a
n
&/n = 0.(Putna. 1#60&
1'+. sequence

1
/ -
n
n
x
is said to have a Cesaro li.it if
1
li.
n
4
1
+ 4
'
+ ... +
4
n
&/n e4ists. 3ind all (real*valued& functions f on the closed interval A0, 1B such that
- f(4
i
& / has a Cesaro li.it if

1
/ -
n
n
x
has a Cesaro li.it.(Putna. 1#6'&
124. a
n
= t1/n and a
n+%
> 0 if a
n
> 0. !how that if four of a
1
, a
'
, ... , a
%
are ,ositive,
then

1 n
a
n
conver(es. >s the converse true?(Putna. 1#6+&
125. <et 0 9 9 1/4. 7efine the sequence ,
n
10 ,
0
= 1, ,
1
= 1 * , ,
n+1
= ,
n
* ,
n*
1
. !how that if each of the events
1
,
'
, ... ,
n
has ,ro1a1ilit0 at least 1 *N , and
i
and
8
are inde,endent for ) i * 8 ) > 1, then the ,ro1a1ilit0 of all
i
occurrin( is at
least ,
n
. Oou .a0 assu.e that all ,
n
are ,ositive.(Putna. 1#6$&
126. a
n
are defined 10 a
1
= , a
'
= , a
n+'
= a
n
a
n+1
/('a
n
* a
n+1
&. , are chosen so
that a
n+1
'a
n
. 3or what , are infinitel0 .an0 a
n
inte(ral?(Putna. 1#6#&
127. 7efine a
n
10 a
0
= , a
n+1
= 'a
n
* n
'
. 3or which are all a
n
,ositive? (Putna.
1#%0&
9
128. <et f(n& = n + AnB. 7efine the sequence a
i
10 a
0
= ., a
n+1
= f(a
n
&. Prove that
it contains at least one square.(Putna. 1#%+&
1'#. 7efine a sequence of conve4 ,ol0(ons P
n
as follows. P
0
is an equilateral
trian(le side 1. P
n+1
is o1tained fro. P
n
10 cuttin( off the corners one*third of the
wa0 alon( each side (for e4a.,le P
1
is a re(ular he4a(on side 1/+&. 3ind
1
li.
n
area(P
n
&. (Putna. 1#%4&
1+0. <et a
n
1e the sequence defined 10 a
1
= +, a
n+1
= +
2
, where 2 = a
n
. <et 1
n
1e
the re.ainder when a
n
is divided 10 100. Lhich values 1
n
occur for infinitel0 .an0
n? (Putna. 1#%5&
1+1. Prove that the sequence a
0
= ', +, $, 14, 40, 15', 6%4, ... with (eneral ter. a
n
= (n+4& a
n*1
* 4n a
n*'
+ (4n*%& a
n*+
is the su. of two well*2nown sequences. (Putna.
1##0&
1+'. <et ! 1e the set of ,oints (4, 0& in the ,lane such that the sequence a
n
defined 10 a
0
= 4, a
n+1
= (a
n
'
+ 0
'
&/' conver(es. Lhat is the area of !?(Putna.
1##'&
133. The sequence a
n
of non*:ero reals satisfies a
n
'
* a
n*1
a
n+1
= 1 for n 1. Prove
that there e4ists a real nu.1er such that a
n+1
= a
n
* a
n*1
for n 1.(Putna. 1##+&
134. <et a
0
, a
1
, a
'
, ... 1e a sequence such that: a
0
= 'K each a
n
= ' or +K a
n
= the
nu.1er of +s 1etween the nth and n+1th ' in the sequence. !o the sequence starts:
'++'+++'+++'++' ... . !how that we can find such that a
n
= ' if n = A.B for
so.e inte(er . 0. (Putna. 1##+&
135. a
n
is a sequence of ,ositive reals satisf0in( a
n
9= a
'n
+ a
'n+1
for all n. Prove
that a
n
diver(es.(Putna. 1##4&
136. 7efine the sequence a
n
10 a
1
= ', a
n+1
= '
a
n
. Prove that a
n
N a
n*1
(.od n& for n
'. (Putna. 1##6&
1+6. 7efine the sequence of deci.al inte(ers a
n
as follows: a
1
= 0K a
'
= 1K a
n+'
is
o1tained 10 writin( the di(its of a
n+1
i..ediatel0 followed 10 those of a
n
. Lhen is
a
n
a .ulti,le of 11?(Putna. 1##%&
1+%. 2 is a ,ositive constant. The sequence 4
i
of ,ositive reals has su. 2. Lhat
are the ,ossi1le values for the su. of 4
i
'
?(Putna. '000&
1+#. 4
1
9 4
'
9 4
+
9 ... is a sequence of ,ositive reals such that li. 4
n
/n = 0. >s it
true that we can find ar1itraril0 lar(e = such that all of (4
1
+ 4
'=*1
&, (4
'
+ 4
'=*'
&, (4
+
+ 4
'=*+
&, ... , (4
=*1
+ 4
=+1
& are less than ' 4
=
?(Putna. '001&
140. The sequence u
n
is defined 10 u
0
= 1, u
'n
= u
n
+ u
n*1
, u
'n+1
= u
n
. !how that for
an0 ,ositive rational 2 we can find n such that u
n
/u
n+1
= 2.(Putna. '00'&
141. The sequence

1
/ -
n
n
a
is defined 10 a
1
=1, a
n+1
=
n
n
a
n
n
a
+
,n1. Prove that
]
n a
n

'
when n 4 (it is denoted 10 ]
x
the inte(er ,art of the nu.1er 4&.
(Jun(ari 1##$* round 4&
14'. <et

1
/ -
n
n
a
1e a sequence of inte(er nu.1er such that (n*1&a
n+1
= (n+1&a
n
*
'(n *1& for an0 n 1. >f '000 divides a
1###
,find the s.allest n ' such that '000
divides a
n
.(Jun(ari 1##4 *round 4&
10
14+. n inte(er sequence satisfies a
n+1
=a
n
+
+1###. !how that it contains at .ost
one square.(PFC 1###&
144. 7efine a sequence a
n
1 10 a
1
=1,a
'
=' and a
n + '
='a
n + 1
* a
n + '
for n 1.
Prove that for an0 . , a
.
a
. + 1
is also a ter. in the sequence.(>=7>= 1##$&
145. <et a
1
=', a
',
=5 and a
n+'
=('*n
'
&a
n+1
+ ('+n
'
&a
n
for n1. 7o there e4ist ,,q,r so
that a
,
a
q
=a
r
.(C:ech*!lova21##5&
14$. 7efined a sequence 10 4
0
,4
1
, Rand 4
n+'
=
n
n
x
x
1
1
+
+
for n0. 3ind 4
1##%
.
(>reland 1##%&
146. 7efined sequences 4
1
,4
'
,......,0
1
,0
'
,..... 10 4
1
=0
1
= + and 4
n+1
=
'
1
n n
x x + + ,
'
1
1 1
n
n
n
y
y
y
+ +

+
. Prove that for n ' we have '9 4
n
0
n
9+.(Jelarus 1###&
14%. Consider a finite sequence (a
n
& so that an0 two distinct su1 sequences
have different su.s. Prove that
'
1
1
<

n
k k
a
.(Do.ania 1###&
14#. <et 4
1
> 0 and 4
n+1
(n+'&4
n
*

1
1
n
n
k
kx
for n '. Prove that for an0 a R the
sequence (4
n
& even tuall0 (ets 1i((er than a. (Do.ania 1###&
150. <et n + 1e an inte(er, and su,,ose that the sequence a
1
, a
'
, ....,a
n
satisfies
a
i*1
+a
i+1
= 2
i
a
i
for ,ositive inte(er 2
i
. Prove that 'n

n
i
i
k
1
+n. (Taiwan1##6&
151. 3ind all sequence a
1
,a
'
,...,a
'000
of real nu.1er such that
1###
'000
1

i
i
a
and for
an0 n1 we have 1/'9a
n
91 and a
n+1
=a
n
('*a
n
&. (Tur2e0 '000&
15'. Prove that for an0 ,ositive inte(er a
1
there is an increasin( sequence of
inte(ers a
1
,a
'
,....so that for an0 natural nu.1er 2 we have a
1
+...+a
2
divide a
1
'
+...
+a
2
'
. (Dussian 1##5&
15+. <et (4
n
& 1e the sequence of natural nu.1er such that: 4
1
=1 and 4
n
94
n+1
'n
for 1n. Prove that for ever0 natural nu.1er 2, there e4ist the su1scri,ts r and s,
such that 4
r
*4
s
=2.(Poland 1##+&
154. The sequence (4
n
& is (iven 10 4
1
=1/', 4
n
=
1
'
+ '

n
x
n
n
for n=',+,.....Prove
that for all natural nu.1er 1 n the followin( inequalit0 holds 4
1
+4
'
+.....+4
n
91.
(Poland 1##5&
155. ;iven a sequence a
1
,a
'
,...,a
##
of one*di(it nu.1ers with the ,o,ert0 that if for
so.e n we have a
1
=1, then a
n+1
'K and if for so.e n we have a
n
=+, then a
n+1
4.
Prove that e4ist two nu.1er 2,l-1,',...,#%/ such that a
2
=a
l
and a
2+1
=a
l+1
.(Poland
1##$*'nd&
15$. ;iven an inte(er n ' and ,ositive nu.1er 4
1
,4
'
,....,4
n
with the su. equal to
1. a& Prove that for an0 ,ositive nu.1er a
1
,...,a
n
with the su. equal to 1, hold the
11
followin( inequalit0:
<

+

n
i i
i i
j i
j i
x
a x
n
n
a a
1
'
1 1
'
'
.
1& 7eter.ine all nu.1er a
1
,...,a
n
for which the a1ove inequalit0 turns into the
equalit0. (Poland 1##$*+rd&
156. 3or a natural nu.1er 2 1 denote 10 p(2& the least ,ri.e nu.1er which is
not a divisor of 2. >f p(2&>', then we define q(2& to 1e the ,roduct of all ,ri.es less
than p(2&K if p(2& =', we ,ut q(2&=1. define the sequence (4
n
& 10 the for.ulas 4
0
=1,
4
n+1
=
& (
& (
n
n n
x q
x p x
for n 0. 7eter.ine all ,ositive inte(ers n with 4
n
=111111.
(Poland 1##$*+rd&
15%. Positve inte(ers 4
1
,...,4
6
satisf0 the conditions:4
$
=144 and 4
n++
=4
n+'
(4
n+1
+4
n
&
for n1. 7eter.ine 4
6
.(Poland 1##6*+rd&
15#. The sequence a
1
,a
'
,...is defined 10 a
1
=0, [ ]
' / & 1 (
' /
& 1 (
+
+
n n
n n
a a
for n>1. 3or
each inte(er 2 0 deter.ine the nu.1er of su1scri,ts n satisf0in( the conditions
'
2+1
>n '
2
, a
n
=0. =ote:
[ ] ' / n
denotes the 1i((est inte(er not 1i((er than n/'.
(Poland 1##6*+rd&
1$0. The sequences (a
n
&,(1
n
&,(c
n
& are (iven 10 the conditions: a
1
=4, a
n+1
= a
n
(a
n
*1&,
' n
b
=a
n
, e n
c n
=1
n
for n=1,',+,.... Prove that the sequence (c
n
& is 1ounded.(Poland
1##%*1st&
161. The 3i1onacci (3
n
&: 3
0
= 3
1
= 1, 3
n+'
= 3
n+1
+ 3
n
for n0. 7eter.ine all ,airs
(2,.& of inte(er, with .> 2 0, for which the sequence (4
n
& defined 10 4
0
=
m
k
F
F
,
4
n+1
= 1 for x
n
=1, x
n+1
=
n
n
x
x

1
1 '
for 4
n
1 contains the nu.1er 1.(Poland
1##%* +rd&
1$'. Prove that the sequence (a
n
& defined 10K a
1
=1K a
n
=a
n*1
+a[ ] ' / n for n=',+,4,....
contains infinitel0 .an0 inte(ers divisi1le 10 6. =ote:
[ ] ' / n
denotes the 1i((est
inte(er not 1i((er than n/'.(Poland 1##%*+rd&
1$+. <et 4
1
>0 1e a (iven real nu.1er. The sequence (4
n
& defined 10 the for.ula:
4
n+1
=4
n
+
'
1
n
x
for n=1, ', +,........Prove that the li.it
+
li.
n
x
n
n
e4ists and find it.
(Poland 1###*1st&
1$4. <et ! 1e a sequence n
1
,n
'
,...,n
1##5
of ,ositive inte(ers such that n
1
+...+n
1##5
=
.9+##0. Prove that for each inte(er q with .q., there is a sequence n
1
i ,n
'
i
12
,....,n
k
i , where 1##5 i k >....>i
'
>i
1
1, n
1
i + n
'
i +....+ n
k
i =q and 2 de,ends on q.
(!in(a,ore #5/#$&
1$5. !u,,ose the nu.1er a
0
, a
1
,...,a
n
satisf0 the followin( conditions: a
0
=
'
1
,
a
2+1
= a
2
+
n
1
a
'
k
for 2=0,1,....,n*1. Prove that 1*
n
1
9a
n
91.(!in(a,ore #$/#6&
1$$. <et a
1
.... a
n
a
n+1
= 0 1e a sequence of real nu.1er. Prove that


n
k
k k
n
k
k
a a k a
1
1
1
& (
. (!in(a,ore #6/#%&
1$6. Lhat is the s.allest tower of 100s that e4ceeds a tower of 100 threes? >n
other words, let a
1
= +, a
'
= +
+
, and a
n+1
is + to the ,ower of a
n
. !i.ilarl0, 1
1
= 100,
1
'
= 100
100
etc. Lhat is the s.allest n for which 1
n
> a
100
? (ustralian 1#%$&
1$%. 7efine the sequence a
1
, a
'
, a
+
, ... 10 a
1
= 1, a
'
= 1, a
n+'
='a
n+1
* a
n
+ ', where
1 is a ,ositive inte(er. !how that a
n
a
n+1
= a
.
for so.e .. (ustralian 1#%$&
1$#. The real sequence 4
1
, 4
'
, 4
+
, ... is defined 10 4
1
= 1, 4
n+1
= 1/s
n
, where s
n
= 4
1

+ 4
'
+ ... + 4
n
. !how that s
n
> 1#%# for sufficientl0 lar(e n. (ustralian 1#%#&
160. The real sequence 4
0
, 4
1
, 4
'
, ... is defined 10 4
0
= 1, 4
1
= 2, 4
n+'
= 4
n
* 4
n+1
.
!how that there is onl0 one value of 2 for which all the ter.s are ,ositive.
(ustralian 1##1&
161. The real sequence 4
0
, 4
1
, 4
'
, ... is defined as follows. 4
0
= 1, 4
1
= 1 + 2,
where 2 is a ,ositive real, 4
'n+1
* 4
'n
= 4
'n
* 4
'n*1
, and 4
'n
/4
'n*1
= 4
'n*1
/4
'n*'
. !how that
4
n
> 1##4 for all sufficientl0 lar(e n. (ustralian 1##4&
16'. 3ind all infinite sequences a
1
, a
'
, a
+
, ... , each ter. 1 or *1, such that no three
consecutive ter.s are the sa.e and a
.n
= a
.
a
n
for all ., n. (ustralian 1###&
16+. The sequence a
1
, a
'
, a
+
, ... has a
1
= 0 and a
n+1
= t (a
n
+ 1& for all n. !how
that the arith.etic .ean of the first n ter.s is alwa0s at least *
'
1
.(ustralian
'00+&

13




14

You might also like