Rearrangement Inequality

I recently read about the Rearrangement Inequality on AOPS , and understood most of it.

If we have two series ( say A & B ) of equal length , then the maximum value of the sum of product of their elements taken two at a time (one from each and not repeated ) is when the numbers to be multiplied are taken from sorted sets and with i=j.

It is easy to see that if there are N sets then we can easily find the maximum value of the sum of product of their elements taken N at a time (one from each and not repeated ) .

I am curious to know is there any general way to find the minimum value ?? All suggestions are welcome and please don't be shy to comment ...

Note by Sanjay Banerji
4 years, 5 months ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

I'm curious what makes you so curious ...

Santanu Banerjee - 4 years, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...