Home
Class 12
MATHS
If a(i) gt 0 (i = 1,2,3,….n) prove that ...

If `a_(i) gt 0` `(i = 1,2,3,….n)` prove that
`sum_(1 le i le j le n) sqrt(a_(i)a_(j)) le (n - 1)/(2) (a_(1) + a_(2) + …. + a_(n))`

Text Solution

Verified by Experts

Using `A.M. ge G.M`., we have
`2^(sin x)+2^(cosx) ge 2sqrt(2^sinx 2^cos x)=2sqrt(2^(sinx+cosx))`
Now we know that
`sin x +cos x ge -sqrt(2)`
`rArr 2^(sinx)+2^(cos x) ge 2sqrt(2^-sqrt(2))`
Hence, the minimum value of `2^sinx +2^cosx is 2(1(1)/(sqrt(2)))`
Promotional Banner

Topper's Solved these Questions

  • INEQUALITIES INVOLVING MEANS

    CENGAGE ENGLISH|Exercise Concept Application Eexercises 6.2|6 Videos

  • INEQUALITIES INVOLVING MEANS

    CENGAGE ENGLISH|Exercise Concept Application Eexercises 6.3|6 Videos

  • INEQUALITIES INVOLVING MEANS

    CENGAGE ENGLISH|Exercise Example 8|1 Videos

  • INEQUALITIES AND MODULUS

    CENGAGE ENGLISH|Exercise Single correct Answer|21 Videos

  • INTEGRALS

    CENGAGE ENGLISH|Exercise All Questions|764 Videos

Similar Questions

Explore conceptually related problems

If a_(i) gt 0 AA I in N such that prod_(i=1)^(n) a_(i) = 1 , then prove that (1 + a_(1)) (1 + a_(2)) (1 + a_(3)) .... (1 + a_(n)) ge 2^(n)

If (x + a_(1)) (x + a_(2)) (x + a_(3)) …(x + a_(n)) = x^(n) + S_(1) x^(n-1) + S_(2) x^(n-2) + …+ S_(n) where , S_(1) = sum_(i=0)^(n) a_(i), S_(2) = (sumsum)_(1lei lt j le n) a_(i) a_(j) , S_(3) (sumsumsum)_(1le i ltk le n) a_(i) a_(j) a_(k) and so on . If (1 + x)^(n) = C_(0) + C_(1) x + C_(2)x^(2) + ...+ C_(n) x^(n) the cefficient of x^(n) in the expansion of (x + C_(0))(x + C_(1)) (x + C_(2))...(x + C_(n)) is

If (x + a_(1)) (x + a_(2)) (x + a_(3)) …(x + a_(n)) = x^(n) + S_(1) x^(n-1) + S_(2) x^(n-2) + …+ S_(n) where , S_(1) = sum_(i=0)^(n) a_(i), S_(2) = (sumsum)_(1lei lt j le n) a_(i) a_(j) , S_(3) (sumsumsum)_(1le i ltk le n)a_(i) a_(j) a_(k) and so on . Coefficient of x^(7) in the expansion of (1 + x)^(2) (3 + x)^(3) (5 + x)^(4) is

If a_(1)gt0 for all i=1,2,…..,n . Then, the least value of (a_(1)+a_(2)+……+a_(n))((1)/(a_(1))+(1)/(a_(2))+…+(1)/(a_(n))) , is

If a_(0) = 0.4 and a_(n+1) = 2|a_(n)|-1 , then a_(5) =

If a_(i)gt0 for i u=1, 2, 3, … ,n and a_(1)a_(2)…a_(n)=1, then the minimum value of (1+a_(1))(1+a_(2))…(1+a_(n)) , is

Let 0 lt A_(i) lt pi for i = 1,2,"……"n . Use mathematical induction to prove that sin A_(1) + sin A_(2)+ "….." + sin A_(n) le n sin ((A_(1) + A_(2) + "……" + A_(n))/(n)) where n ge 1 is a natural number. [You may use the fact that p sin x + (1-p) sin y le sin [px+(1-p)y] , where 0 le p le 1 and 0 le x , y le pi ]

Given a_(i)^(2) + b_(i)^(2) + c_(i)^(2) = 1, i = 1, 2, 3 and a_(i) a_(j) + b_(i) b_(j) + c_(i) c_(j) = 0 (i !=j, i, j =1, 2, 3) , then the value of the determinant |(a_(1),a_(2),a_(3)),(b_(1),b_(2),b_(3)),(c_(1),c_(2),c_(3))| , is

( 1 + x + x^(2))^(n) = a_(0) + a_(1) x + a_(2) x^(2) + …+ a_(2n) x^(2n) , then a_(0) + a_(1) + a_(2) + a_(3) - a_(4) + … a_(2n) = .

If a_(1), a_(2), a_(3).... A_(n) in R^(+) and a_(1).a_(2).a_(3).... A_(n) = 1 , then minimum value of (1 + a_(1) + a_(1)^(2)) (a + a_(2) + a_(2)^(2)) (1 + a_(3) + a_(3)^(2))..... (1 + a_(n) + a_(n)^(2)) is equal to