Inequality with summation If ai positive numbers and n>=2 (the subscripts are taken modulo n), how can I prove the following inequality n sum_(k=1)^n 1/((n-1)a_k+a_(k+1))<=sum_(k=1)^n 1/(a_k)?

wijii4

wijii4

Answered question

2022-09-24

Inequality with summation
If a i positive numbers and n 2 (the subscripts are taken modulo n), how can I prove the following inequality
n k = 1 n 1 ( n 1 ) a k + a k + 1 k = 1 n 1 a k ?

Answer & Explanation

hampiova76

hampiova76

Beginner2022-09-25Added 5 answers

By C-S
n k = 1 n 1 ( n 1 ) a k + a k + 1 n ( n 1 + 1 ) 2 k = 1 n ( ( n 1 ) 2 ( n 1 ) a k + 1 2 a k + 1 ) =
= 1 n k = 1 n ( n 1 a k + 1 a k + 1 ) = 1 n k = 1 n ( n 1 a k + 1 a k ) = k = 1 n 1 a k .

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?