Mathematical Induction Problem

Prove that for every natural \(n\), it is inequality:

12×34×56...2n12n13n+1\frac { 1 }{ 2 } \times \frac { 3 }{ 4 } \times \frac { 5 }{ 6 } ...\frac { 2n-1 }{ 2n } \le \frac { 1 }{ \sqrt { 3n+1 } }

#MathematicalInduction #Inequality

Note by Carlos E. C. do Nascimento
7 years, 2 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

I am not sure what exactly I am supposed to do here, even though I have been on Brilliant for a year I haven't been regular. So, I hope I am doing the right thing.

P(1)P(1) is true. Assume P(n)P(n) to be true.

P(n+1)    122n12n2n+12n+213n+4P\left(n + 1\right) \implies \frac 1 2 \dots \frac {2n-1}{2n} \cdot \frac{2n + 1}{2n + 2} \leq \frac{1}{\sqrt{3n + 4}} From P(n)P(n), 13n+12n+12n+213n+4\frac{1}{\sqrt{3n + 1}} \cdot \frac{2n + 1}{2n + 2} \leq \frac{1}{\sqrt{3n + 4}} After squaring and cross-multiplying,     (3n+4)(4n2+4n+1)4(n2+2n+1)(3n+1)\implies \left( 3n + 4 \right)\left(4n^2 + 4n + 1\right) \leq 4\left(n^2 + 2n +1\right)\left(3n + 1\right)

I hope you can draw the conclusion from here.

Note: This is actually a very standard problem and can be found in almost every math contest book (In case, anyone is interested.)

Ishaan Singh - 7 years, 2 months ago

Log in to reply

What is 4(n2+2n+1)(3n+1)(4n2+4n+1)(3n+4)4(n^2 + 2n + 1)(3n + 1) - (4n^2 + 4n + 1)(3n + 4)? You should get something very simple.

Jon Haussmann - 7 years, 2 months ago

First of all, we can prove that "2n+12n+23n+13n+4\frac{2n+1}{2n+2} \leq \frac{\sqrt{3n+1}}{\sqrt{3n+4}}" is true.

Prove) Expansion the above inequality, we get (4n2+4n+1)(3n+4)(4n2+8n+4)(3n+1) (4n^2+4n+1)(3n+4) \leq (4n^2+8n+4)(3n+1) . clean up this inequality, it become 0n 0 \leq n . this is alway true when n is natural number.

if P(n) to be true and "2n+12n+23n+13n+4\frac{2n+1}{2n+2} \leq \frac{\sqrt{3n+1}}{\sqrt{3n+4}}" is also true, then 12×34×56××2n12n×2n+12n+213n+1×3n+13n+4\frac{1}{2} \times \frac{3}{4} \times \frac{5}{6} \times \dots \times \frac{2n-1}{2n} \times \frac{2n+1}{2n+2} \leq \frac{1}{\sqrt{3n+1}} \times \frac{\sqrt{3n+1}}{\sqrt{3n+4}} ". so P(n+1) is also true.

P(1) is true, If P(n) is true, P(n+1) also true. So for every n, this inequality is true.

Sung Moo Hong - 7 years, 2 months ago

Nice question.

Edit: There is a easy proof for a looser bound go 12n+1 \frac{1} { \sqrt{2n+1} } that doesn't use induction.

Edit: The RHS can be tightened to 1αn+β \frac{ 1 } { \sqrt { \alpha n+ \beta} } for some constant α<π \alpha < \pi and β \beta . However, this requires more work.

Calvin Lin Staff - 7 years, 2 months ago

Log in to reply

How is that tightening? 12n+1\frac{1}{\sqrt{2n + 1}} is greater than 13n+1\frac{1}{\sqrt{3n + 1}}.

Incidentally, 12342n12n=(2n)!4n(n!)2.\frac{1}{2} \cdot \frac{3}{4} \dotsm \frac{2n - 1}{2n} = \frac{(2n)!}{4^n (n!)^2}. By Stirling's approximation, (2n)!4n(n!)21πn.\frac{(2n)!}{4^n (n!)^2} \approx \frac{1}{\sqrt{\pi n}}.

Jon Haussmann - 7 years, 2 months ago

Log in to reply

Oopps, wasn't thinking. Let me down vote myself.

Indeed, I wanted a coefficient of π \pi instead.

Calvin Lin Staff - 7 years, 2 months ago
×

Problem Loading...

Note Loading...

Set Loading...