Monotone Sequences and Their Transformations: Proving or Disproving Monotonicity

  • Thread starter Thread starter cnwilson2010
  • Start date Start date
  • Tags Tags
    Rules Sequences
cnwilson2010
Messages
8
Reaction score
0

Homework Statement


Let an be monotone sequences. Prove or give a counterexample:

The sequence cn given by cn=k*an is monotone for any Real number k.

The sequence (cn) given by cn=(an/bn) is monotone.

Homework Equations





The Attempt at a Solution



On the first one, I don't think the change of sign on k can change the "monotoneness" of the sequence other than by changing decreasing to increasing and vice versa.

I have played around using different sequences to see if this is true and it is looking like it is, but I just feel that it could be false.

Any ideas?
 
Last edited:
Physics news on Phys.org
for the first calculate the difference between terms and show it is always either pos or neg

2nd find a simple counter example, consider an alternating series
 
I neglected to put the condition that bn is also monotone.

So I was thinking of an with a different sign than bn but this doesn't seem to change much either.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top