Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 67 views

    A Fraction of A Dot: Stumbling Robot

    Uploaded by

    Pipe
    The document proves that if n real numbers have a product of 1, then their sum is greater than n. It considers two cases: 1) if all numbers are 1, then the sum is equal to n, and 2) if at least one number is not 1, then by induction the sum is greater than n. It shows for n=2, if one number is greater than 1 and the other less than 1, their sum is greater than 2. By induction, this extends to any n numbers whose product is 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    A Fraction of A Dot: Stumbling Robot

    Uploaded by

    Pipe
    67 views2 pages
    The document proves that if n real numbers have a product of 1, then their sum is greater than n. It considers two cases: 1) if all numbers are 1, then the sum is equal to n, and 2) if at least one number is not 1, then by induction the sum is greater than n. It shows for n=2, if one number is greater than 1 and the other less than 1, their sum is greater than 2. By induction, this extends to any n numbers whose product is 1.

    Original Title

    19

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document proves that if n real numbers have a product of 1, then their sum is greater than n. It considers two cases: 1) if all numbers are 1, then the sum is equal to n, and 2) if at least one number is not 1, then by induction the sum is greater than n. It shows for n=2, if one number is greater than 1 and the other less than 1, their sum is greater than 2. By induction, this extends to any n numbers whose product is 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    67 views2 pages

    A Fraction of A Dot: Stumbling Robot

    Uploaded by

    Pipe
    The document proves that if n real numbers have a product of 1, then their sum is greater than n. It considers two cases: 1) if all numbers are 1, then the sum is equal to n, and 2) if at least one number is not 1, then by induction the sum is greater than n. It shows for n=2, if one number is greater than 1 and the other less than 1, their sum is greater than 2. By induction, this extends to any n numbers whose product is 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    12/11/2019 Prove that if n real numbers have product 1, then they have sum greater than n - Stumbling Robot

    Stumbling Robot
    a fr a c t i o n of a dot

    Home » Blog » Prove that if n real numbers have product 1, then they have sum greater than n

    Prove that if n real numbers have product 1, then they have sum greater than n

    by RoRi July 1 0 , 2015

    Given . Then if

    prove that

    with equality if and only if .

    Proof. We consider two cases: the first one is the case that , and the second is the case that for
    at least one in .
    Case #1: If , then

    Thus, the inequality holds (in fact, equality holds).


    Case #2: Now for the case that at least one of the . The proof is by induction on the number of terms . For the case
    , we have , and by assumption at least one of these is not equal to 1. But, if one of them is not 1, then
    neither is the other (since the product must equal 1). So,

    www.stumblingrobot.com/2015/07/10/prove-that-if-n-real-numbers-have-product-1-then-they-have-sum-greater-than-n/ 1/5
    12/11/2019 Prove that if n real numbers have product 1, then they have sum greater than n - Stumbling Robot

    Where the final inequality follows since since by assumption. Therefore, the inequality indeed holds
    for the case .
    Assume then that the inequality holds for some . Then, let with for at least
    one . If , then there must be some such that (otherwise, if for all ,
    then ). Similarly, if , then there is some such that . Hence, we have a pair,
    with one member of the pair greater than 1, and the other less than 1. Without loss of generality (since multiplication and
    addition are commutative), let this pair be and . Then, define . So,

    Further, since (since one of is greater than 1 and the other is less than 1, so one of
    is positive and the other is negative), we have

    Thus,

    Hence, the inequality holds for ; and therefore, for all

    Related

    Prove a generalization of Bernoulli's Compute the limit of the recursive Prove some properties of two
    inequality sequence an+1 = (an + an-1) / 2 alternative definitions of the norm
    (http://www.stumblingrobot.com/2 (http://www.stumblingrobot.com/2 (http://www.stumblingrobot.com/2
    015/07/10/prove-a-generalization- 016/03/29/compute-limit-recursive- 016/04/28/prove-properties-two-
    of-bernoullis-inequality/) sequence-an1-1-2/) alternative-definitions-norm/)
    July 10, 2015 March 29, 2016 April 28, 2016

    www.stumblingrobot.com/2015/07/10/prove-that-if-n-real-numbers-have-product-1-then-they-have-sum-greater-than-n/ 2/5

    You might also like