Proving an Inequality : Let an, n>= 1 be an increasing sequence of positive real numbers. Prove that 1/a1 + 2/(a1 + a2) + .... + n/(a1 +... + an) < 4(1/a1 + 1/a2 + ... + 1/an)

Related BrainMass Solutions

• Recursive definitions

  Give a recursive definition of a) of the functions max and min so that mx{a1,a2,..an and min {a1,a2,...an} are the maximum and minimum of the n numbers a1,a2,...an respectively Let the numbers a1, a2, ... an be stored in an n-size array called numbers

• One Dimensional Normed Linear Space : Completeness and Continuity

  (2) From (1) --> ||a(m+n)*U - a(m)*U|| < eps --> ||(a(m+n)-a(m))*U|| < eps --> |a(m+n) - a(m)|*||U|| < eps --> |a(m+n) - a(m)| < eps (3) Since a(n) is a sequence of real positive numbers, any such a sequence is convergent

• Proof by Mathematical Induction

  147414 Proof by Mathematical Induction Prove the following statement: Prove that if A1+A2+....+An=n then A1A2...An<=1, where A1,A2,...,An are positive real numbers. Proof: When n=1, if A1=n, then A1=1<=1 is true. Suppose "A1+A2+...

• Inequality: Proof using Unit Vectors

  8596 Inequality: Proof using Unit Vectors Prove that (a1b1+a2b2+...+anbn)^2<=(a1^2+a2^2+...+an^2)(b1^2+b2^2+...+bn^2) where ai, bi are real numbers, i=1,2,...,n Proof. Consider two vectors x=(a1,a2,...,an) and y=(b1,b2,...,bn).

• Show That a Sequence Converges

  But this argument can be read in reverse. So that if an < sqrt(2) then so is an+1. Conclusion: a1 < sqrt(2) But if it's true for a1 then it's true for a2. But if it's true for a2 then it's true for a3.

• Solving Discrete Mathematics Questions

  Let a1, a2, a3, . . . be the integer sequence defined recursively by a. a1 =0; and b. For n > 1, an = + a[n/2]. a1=0, a2=a1=0, a3=a1=0, a4=a2=0,...., an=0 for all integer n starting from 1.

• Polynomials and second derivatives

  (note: p''= p double prime and t^2 = t raised to the power of 2) Solution : Let p(t)= a0+ a1*t+a2*t^2+a3*t^3+...+an*t^n Then p'(t)=a1+2*a2*t+3*a3*t^2+...+n*an*t^(n-1) p''(t)=2*a2+6*a3*t+...

• Kernel equivalence and natural mapping

  Since $([a1]) = $([a2]), we see that %(a1) = %(a2). Thus a1 == a2, by the definition of ==. Hence [a1] = [a2], so $ is one-to-one. c. Assume that % is onto. To show that $ is onto, let b be an element of B.

• Limit of a sequence of event is obtained

  206607 Limit of a sequence of event is obtained Question 1 Let A1, A2,...,An be a sequence of increasing events of a sample space. That is, Ai is a subset of Ai+1 i 1. Let B1=A1 and Bi = Ai - Ai-1. Note that Ui=1 to Ai = Ui=1 to Bi a.