Mathematical Induction

How do I get good at induction in 12 hours?

>CS majors

it's easy if you know the tricks

lol

H-How did you know?

Which are? I've gotten >=B's in every class, but induction is killing me, and I've been googling it for days.

Not him, but he knew because you're trying to cram induction in 12 hours. Which means you're not a math major, but you have to know proof by induction. So, CS.

Prove the theorem true for the base case

Assume the theorem is true for the n case. Prove that with this assumption the theorem is true for the n+! case.

That's the gist of it.

Isn't induction somewhat a mathematical fallacy since you're proving something based on an assumption?

Think of it as a ladder

We prove it for some base, i.e n = 1

Now we assume n is true and we prove it for n+1

Because we know 1 is true, it follows that 2 is true because we proved it for n+1,

Because we know 2 is true, it follows that 3 is true, and so on and so forth.

It's not a fallacy because you can actually prove that induction is true(had to do it for a class). If you think of it as a ladder it makes more sense. We pick some starting step, then we pick an arbitrary step and show the next step is true. We can then start at the bottom and move up because we know the bottom is true.

b-b-b-brainlet