Question
Question: If \({{a}_{1}},{{a}_{2}},....{{a}_{n}}\) are positive numbers such that \({{a}_{1}}\cdot {{a}_{2}}\c...
If a1,a2,....an are positive numbers such that a1⋅a2⋅a3.....an=1 then their sum is
(A) a positive integer
(B) divisible by n
(C) never less than n
(D) none of these
Solution
In this question we have been given a series of terms for which we have been given that all the numbers in the series are positive. We know that the product of all the terms in the series is equal to 1. We will solve this question by using the mathematical property that the arithmetic mean is greater than or equal to the geometric mean for the same series. We will then substitute the values given in the series and simplify to get the required solution.
Complete step-by-step solution:
We know that a1,a2,....an are positive numbers.
We also know that a1⋅a2⋅a3.....an=1.
Now we know that for the same series the arithmetic mean is greater than or equal to the geometric mean. Therefore, mathematically we can write it as:
⇒A.M≥G.M
Now since there are total n number of terms in the series, we can write the arithmetic mean as:
⇒A.M=(na1+a2+a3+....+an)
And the geometric mean of the terms can be written as:
⇒G.M=(a1⋅a2⋅a3.....an)n1
On equating both, we get:
⇒(na1+a2+a3+....+an)≥(a1⋅a2⋅a3.....an)n1
Now we know that a1⋅a2⋅a3.....an=1 therefore, on substituting, we get:
⇒(na1+a2+a3+....+an)≥(1)n1
Now we know that 1 raised to anything is 1 therefore, we can write:
⇒(na1+a2+a3+....+an)≥1
On transferring the term n from the left-hand side to the right-hand side, we get:
⇒(a1+a2+a3+....+an)≥n
Therefore, from the above expression, we can say that the sum of the terms in the series will never be less than n.
Hence the correct answer is option (C).
Note: In this question we have used the relation between the arithmetic mean and geometric mean for the sequence of terms given. There also exists another type of mean which is the harmonic mean which could be written for the above terms as H.M=(a11+a21+a31+....+an1)n. The relationship between all three is that A.M≥G.M≥H.M.