1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Abstract Algebra Proof by induction problem

  1. Dec 31, 2013 #1
    1. The problem statement, all variables and given/known data
    Show via induction that the nth root of (a1 * a2 * a3 * ... an) ≤ 1/ (n) * ∑ ai, where i ranges from 1 to n.


    2. Relevant equations
    Induction


    3. The attempt at a solution

    Let Pn be the statement above. It is clear that P1 holds since a1 ≤ a1. Now let us assume that Pn holds for any arbitrary integer k, that is the kth root of (a1 * a2 * a3 * a4 * ... ak) ≤ 1/k * ∑ ai

    where i ranges from 1 to k.

    I need to show that the (k + 1)th root is ≤ 1/ (k + 1) * ∑ ai, where i ranges from 1 to k + 1. I have had no such luck doing this. Would complete induction be required here?



    The source of the problem is from Abstract Algebra, Theory and Applications from T. W. Judson (2013 version).
     
  2. jcsd
  3. Dec 31, 2013 #2

    Ray Vickson

    User Avatar
    Science Advisor
    Homework Helper

    Are all the ai supposed to be > 0? If so, try first to look at the simple case of n = 2.
     
    Last edited: Dec 31, 2013
  4. Dec 31, 2013 #3
    All ai ⋲ N, so yes they are. And for n = 2 I eventually receive that √(a1 * a2) ≤ 1/2 (a1 + a2)
    Or a1 * a2 ≤ [(a1 + a2)^2] / 4. Not entirely sure why I would want to do multiple base cases, but I think you are on the right track.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Abstract Algebra Proof by induction problem
Loading...