Waste less time on Facebook — follow Brilliant.
×

Mathematical induction

Main post link -> https://brilliant.org/assessment/techniques-trainer/mathematical-induction/

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
4 years, 1 month ago

No vote yet
14 votes

Comments

Sort by:

Top Newest

The good part is "We now sit back and drink a cup of coffee" that really nice sir :) Dhelia Dhelia · 4 years, 1 month 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 · 4 years, 1 month ago

Log in to reply

Sir, can you tell me, that how many types of induction are there? Siddharth Kumar · 4 years, 1 month ago

Log in to reply

@Siddharth Kumar 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 \(P_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 · 4 years, 1 month ago

Log in to reply

@Calvin Lin 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 · 4 years, 1 month 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 · 4 years, 1 month ago

Log in to reply

@Shobhit Gautam yes, please tell about them. Siddharth Kumar · 4 years, 1 month ago

Log in to reply

@Shobhit Gautam please tell Superman Son · 4 years, 1 month ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...