How do I show that the recursive sequence
an=a⌊n/2⌋+a⌈n/2⌉+3n+1,n≥2,xa1=3
is an increasing sequence?
1. attempt:
If I can show that an+1−an>0, I would be able to show it is increasing.
an+1−an=a⌊n+12⌋+a⌈n+12⌉+3(n+1)+1−(a⌊n/2⌋+a⌈n/2⌉+3n+1)=a⌊n+12⌋+a⌈n+12⌉+3−a⌊n/2⌋−a⌈n/2⌉
I can't put a together because the indexes are different (because of the ceils and floors).
2. attempt:
Proof by induction
Base case: n=2 then a2=a1+a1+3⋅2+1=3+3+7=13 so $a_1
Testing with more gives: a1<a2<a3=26<a4=39<...
Assume $a_n
an+2=a⌊(n+2)/2⌋+a⌈(n+2)/2⌉+3(n+2)+1
Again I get stuck since I don't know how to handle the ceils and floors.
x
How do I go about showing the sequence is increasing? Maybe I'm making it harder than it actually is - is there by any chance an easier way?
Answer
For an even index we have
a2n=2an+6n+1
and for an odd one,
a2n+1=an+an+1+6n+4
so if we assume (using induction) that an+1≥an then
a2n+2=2an+1+3(2n+2)+1=2an+1+6n+7>an+an+1+6n+4=a2n+1
and
a2n+1=an+an+1+6n+4>2an+6n+1=a2n
Remark: Perhaps one of two more base cases are needed.
No comments:
Post a Comment