Intereting Posts

How calculators do trigonometry
Can anyone help me with a solution?
Demystify integration of $\int \frac{1}{x} \mathrm dx$
Lebesgue Integral of a piecewise defined function defined on irrationals and rationals(GATE-2017)
When does function composition commute?
$(ℤ/mℤ)/(\bar n) ≅ℤ/nℤ$ with $n|m$
Integrating a matrix
Show that a proper continuous map from $X$ to locally compact $Y$ is closed
Prove that if $g^2=e$ for all g in G then G is Abelian.
Closed form for $\sum\limits_{k=1}^{\infty}\zeta(4k-2)-\zeta(4k)$
principal value as distribution, written as integral over singularity
Fields – Proof that every multiple of zero equals zero
Evaluating $\int_{0}^{1} dx\frac{\log(1+x)}{1 + x^2}$
Prove the following equation of complex power series.
Evaluation of $\int\frac{5x^3+3x-1}{(x^3+3x+1)^3}\,dx$

I just started to learn induction in my first year course. I’m having a difficult time grasping the concept. I believe I understand the basics but could someone summarize simple induction and strong induction and explain what the differences are? The video I’m watching explains that if $P(k)$ is true then $P(k+1)$ is true for simple induction, and for strong induction if $P(i)$ is true for all $i$ less than equal to $k$ then $P(k+1)$ is true. I don’t really know what that means.

- How to apply 1st Isomorphism Theorem to show that a finite abelian group has a subgroup of order $n$ for each positive divisor $n$ of its order
- Simplify sum of factorials with mathematical induction
- Prove even integer sum using induction
- Need help with Knuth's proof for Gray Codes
- Proof by induction regarding injections and part of the pigeonhole principle
- Proof related to Harmonic Progression
- I'm having trouble with a proof by induction
- Prove by Induction : $\sum n^3=(\sum n)^2$
- Counterexamples to “Naive Induction”
- Use an induction argument to prove that for any natural number $n$, the interval $(n,n+1)$ does not contain any natural number.

With simple induction you use “if $p(k)$ is true then $p(k+1)$ is true” while in strong induction you use “if $p(i)$ is true for all $i$ less than or equal to $k$ then $p(k+1)$ is true”, where $p(k)$ is some statement depending on the positive integer $k$.

They are NOT “identical” but they are equivalent.

It is easy to see that if simple induction is true then strong induction is true: if you know that statement $p(i)$ is true for all $i$ less than or equal to $k$, then you know that it is true, in particular, for $i=k$ and can use simple induction.

It is harder to prove, but still true, that if strong induction is true, then simple induction is true. That is what we mean by “equivalent”.

Here we have a question. It is not why we still have “weak” induction – it’s why we still have “strong” induction when this is not actually any stronger.

My opinion is that the reason this distinction remains is that it serves a pedagogical purpose. The first proofs by induction that we teach are usually things like $\forall n\left[\sum_{i=0}^n i= \frac{n(n+1)}{2}\right]$. The proofs of these naturally suggest “weak” induction, which students learn as a pattern to mimic.

Later, we teach more difficult proofs where that pattern no longer works. To give a name to the difference, we call the new pattern “strong induction” so that we can distinguish between the methods when presenting a proof in lecture. Then we can tell a student “try using strong induction”, which is more helpful than just “try using induction”.

One example of the use of strong induction is in the inductive proof that any prime $p\not \equiv 3 \pmod 4$ is the sum of squares of two integers. We have $2=1^2+1^2.$ For prime $p\equiv 1 \pmod 4,$ at some point in the proof we need to employ the inductive hypothesis that every prime $q$ such that $p>q\not \equiv 3 \pmod 4$ is the sum of two squares, because (after a fair bit of other work) such a $q$ appears in the algebra but we don’t know which one it is.

- Measure theoretic proof of $|\Bbb{Z}^d/A\Bbb{Z}^d| = |\det(A)|$
- What is the number of automorphisms (including identity) for permutation group $S_3$ on 3 letters?
- Kernel of linear transformation in $\Bbb R^3$
- Let $a$ be a quadratic residue modulo $p$. Prove that the number $b\equiv a^\frac{p+1}{4} \mod p$ has the property that $b^2\equiv a \mod p$.
- Manifolds with boundaries and partitions of unity
- How to evaluate $\sum\limits_{k=0}^{n} \sqrt{\binom{n}{k}} $
- Splitting of primes in an $S_3$ extension
- How to to a better approach for this :?
- When is the image of a null set also null?
- Understanding dependency graph for a set of events
- Probability describing how many adjacent hexagons overlap a circle of a given radius
- What is the vector form of Taylor's Theorem?
- Why are every structures I study based on Real number?
- Function Sequence Uniform Convergence
- show that: $f$ is injective $\iff$ there exists a $g: Y\rightarrow X$ such that $g \circ f = idX$