Not enough information at all!

Let P(x)P(x) be a polynomial with positive coefficients. Prove that if

P(1x)1P(x)P \left (\dfrac{1}{x} \right ) \geq \dfrac{1}{P(x)}

holds for x=1x=1, then it holds for all x>0x > 0.

#Sharky

Note by Sharky Kesa
5 years, 7 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

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×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Let n=degPn = \deg P and P(x)=i=0naixi\displaystyle P(x) = \sum_{i=0}^n a_ix^i.

First, note that if the inequality holds for x=1x = 1, then we have

P(1)1P(1)P(1)2=(i=0nai)21()P(1) \geq \frac{1}{P(1)} \longrightarrow P(1)^2 = \left( \sum_{i=0}^n a_i \right)^2 \geq 1 \qquad (*)

We recall the Cauchy-Schwarz inequality, which states that (i=0nαi2)(i=0nβi2)(i=0nαiβi)2\displaystyle \left( \sum_{i=0}^n \alpha_i^2 \right)\left( \sum_{i=0}^n \beta_i^2 \right) \geq \left( \sum_{i=0}^n \alpha_i\beta_i \right)^2. If we let αi=aixi\alpha_i = \sqrt{a_ix^i} and βi=ai/xi\beta_i = \sqrt{a_i/x^i}, then we have

(i=0naixi)(i=0naixi)(i=0nai)2\left( \sum_{i=0}^n a_ix^i \right)\left( \sum_{i=0}^n \frac{a_i}{x^i} \right) \geq \left( \sum_{i=0}^n a_i \right)^2

Now, we observe that i=0naixi=P(x)\displaystyle \sum_{i=0}^n a_ix^i = P(x) and i=0naixi=P(1x)\displaystyle \sum_{i=0}^n \frac{a_i}{x^i} = P\left(\frac{1}{x}\right). Using ()(*), we have

P(x)P(1x)(i=0nai)21P(x)P\left(\frac{1}{x}\right) \geq \left( \sum_{i=0}^n a_i \right)^2 \geq 1

Hence, we divide both ends by P(x)P(x) to obtain our desired equality:

P(1x)1P(x)\boxed{\displaystyle P\left(\frac{1}{x}\right) \geq \frac{1}{P(x)}}

Jake Lai - 5 years, 7 months ago

Log in to reply

Very nice solution. Cauchy-Schwarz was the best method (in my opinion). +1

Sharky Kesa - 5 years, 7 months ago

Log in to reply

Why thank you! I'm not entirely adept at utilising Cauchy-Schwarz to its fullest extent but I'm quite happy with the results.

Is this problem an original one? If so, well-posed!

Jake Lai - 5 years, 7 months ago

Log in to reply

@Jake Lai Yes, it was an original problem but no doubt other people have seen this before. I just used C-S to make this problem.

Sharky Kesa - 5 years, 7 months ago

Great Solution!

Ingenious use of the C-S inequality!

Sualeh Asif - 5 years, 7 months ago

Nice Solution! I like the way you used Cauchy-Schwarz inequality to prove this.

Surya Prakash - 5 years, 7 months ago
×

Problem Loading...

Note Loading...

Set Loading...