It's easy to prove that following upperbound is true: sum_(i=1)^N a_i ln a_i <= A \ln A, where sum_(i=1)^N a_i=A and a_i>=1 I'm wondering, is there stronger upperbound?

HypeMyday3m

HypeMyday3m

Answered question

2022-09-24

Upperbound for i = 1 N a i ln a i
It's easy to prove that following upperbound is true:
i = 1 N a i ln a i A ln A, where i = 1 N a i = A and a i 1
I'm wondering, is there stronger upperbound?

Answer & Explanation

Katelyn Ryan

Katelyn Ryan

Beginner2022-09-25Added 11 answers

You can also use the following estimate
j = 1 N a j ln a j A ln ( A N + 1 ) .

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?