Mathematical induction

Main post link ->

Learn about mathematical induction, a method of proof typically used to establish that a given statement is true for all natural numbers.

Note by Calvin Lin
8 years ago

No vote yet
14 votes

  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]( 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}


Sort by:

Top Newest

The good part is "We now sit back and drink a cup of coffee" that really nice sir :)

Dhelia Dhelia - 8 years ago

Log in to reply

At the end of the first worked example:

{We now sit back and drink a cup of coffee.]

You're mixing up your brackets. :)

Tim Vermeulen - 8 years ago

Log in to reply

Sir, can you tell me, that how many types of induction are there?

Siddharth Kumar - 8 years ago

Log in to reply

The works 'type' could either refer to various types of applications (first paragraph), or various mathematical topics where induction can be applied (second paragraph).

I have broadly identified 5-6 different applications that are based off the underlying idea of Induction, and will plan to explore them in the upcoming weeks. For example, students generally have heard of the Non-standard Induction, where you use several base cases instead of just 1, or the Strong Induction, where you use every preceding statement, instead of just PkP_k.

Almost every mathematical topic has a problem which yields to an inductive approach. In the post, I've presented a question on summation of series, and another on divisibility. Other areas include recurrence relations, inequalities, functional equations, integration/differentiation, games, etc.

Edit: Here are various 'types' of induction. This might not be a complete list.

  1. The first principle of finite induction is mentioned in this post.
  2. The second principle of finite induction is also known as strong induction.
  3. The third principle of finite induction is also known as non-standard induction.
  4. There's also Forward-Backward Induction, as used in the Proof of AM-GM.
  5. I've referred to something that I call 'stronger induction', which means proving a stronger statement than what was given.
  6. There's the principle of transfinite induction, which extends it from the integers to well-ordered sets like the ordinals or the cardinal numbers. This requires the axiom of choice.
  7. Structural induction, used in logic, computer science, graph theory,
  8. Well-founded induction, also known as Noetherian induction.

Calvin Lin Staff - 8 years ago

Log in to reply

there are three types of induction, first principle induction second principle induction third principle induction. if u want to know about them, just reply here.

Shobhit gautam - 8 years ago

Log in to reply

@Shobhit Gautam please tell

superman son - 8 years ago

Log in to reply

@Shobhit Gautam yes, please tell about them.

Siddharth Kumar - 8 years ago

Log in to reply

@Shobhit Gautam I'm fairly certain that there are only two principles; I have never heard of a third.

The first principle is simple induction, and the second principle is the Strong Induction that Calvin alludes to in his comment.

David Altizio - 8 years ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...