discrete mathematics - What exactly is the difference between weak and strong induction? - Mathematics Stack Exchange
Mathematics is part of Stack Overflow’s open communities: specialist spaces where curiosity is welcome, knowledge is shared freely, and the best answers rise to the top. Bring the best of human thought and AI automation together at your work. Learn more Looking for your teams? Stack Internal has its own domain! You can now access your teams at stackoverflowteams.com. Teams no longer appear in the left sidebar on stackoverflow.com. Check your email to learn more about these changes. Stack Internal Knowledge at work Bring the best of human thought and AI automation together at your work. I am having trouble seeing the difference between weak and strong induction. There are a few examples in which we can see the difference, such as reaching the 𝑘 𝑡ℎ 𝑘 𝑡 ℎ rung of a ladder and proving every integer >1 > 1 can be written as a product of primes: To show every 𝑛≥2 𝑛 ≥ 2 can be written as a product of primes, first we note that 2 2 is prime. Now we assume true for all integers 2