English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

sequence b(sub n), n=1,2,3... is strictly locally monotone if for every integer k>1 either b(sub k-1) < b(sub k) < b(sub k-1) OR b(sub k-1) > b(sub k) >b(sub k+1).
Prove it is strictly monotone or give counterexample.

2007-09-26 05:41:24 · 2 answers · asked by mandy 1 in Science & Mathematics Mathematics

2 answers

It appears that a sequence would satisfy your defn of locally monotone if, for example, b_1 < b_2 < b_3 and b_4 > b_5 > b_6, but such a sequence is not monotone.

2007-09-26 08:57:43 · answer #1 · answered by Tony 7 · 0 0

i think it is strictly monotone, use induction

2007-09-26 06:21:54 · answer #2 · answered by Theta40 7 · 0 0

fedest.com, questions and answers