Discrete math : Induction proof

Click For Summary
SUMMARY

The forum discussion focuses on the application of mathematical induction in discrete math, specifically addressing the induction step for proving statements related to even numbers. The user highlights the challenge of incorporating the additional number, ##n+1##, into existing sets for ##n##. The discussion emphasizes counting the new sets formed when ##n+1## is even, providing a clear method for completing the proof.

PREREQUISITES
  • Understanding of mathematical induction principles
  • Familiarity with discrete mathematics concepts
  • Basic knowledge of set theory
  • Ability to manipulate even and odd integers
NEXT STEPS
  • Study the principles of mathematical induction in detail
  • Explore examples of induction proofs in discrete mathematics
  • Learn about set theory and its applications in proofs
  • Practice problems involving even and odd integers in proofs
USEFUL FOR

This discussion is beneficial for students of discrete mathematics, educators teaching mathematical proofs, and anyone seeking to strengthen their understanding of induction techniques.

boxz
Messages
1
Reaction score
0
Stuck on the induction step,please help
 

Attachments

  • QQ??20130920165809.jpg
    QQ??20130920165809.jpg
    13.5 KB · Views: 497
  • QQ??20130920165828.jpg
    QQ??20130920165828.jpg
    14.8 KB · Views: 493
Physics news on Phys.org
For ##n+1## you get one extra number. If it is even you can add it to the "even" sets you have for ##n## and you get additional sets. Count them.
 

Similar threads

Do these two statements imply an underlying induction proof?
  • · Replies 7 ·
Replies
7
Views
1K
Prove this inequality using induction
  • · Replies 2 ·
Replies
2
Views
2K
Solve this problem that involves induction
  • · Replies 7 ·
Replies
7
Views
3K
Prove by induction the sum of complex numbers is complex number
  • · Replies 4 ·
Replies
4
Views
2K
Prove that if any f:X-->Y is continuous, X is the discrete topology
  • · Replies 23 ·
Replies
23
Views
4K
[Discrete] Prove that |nZ| = |Z| for any postive integer n
  • · Replies 1 ·
Replies
1
Views
2K
Proof by induction for rational function
  • · Replies 7 ·
Replies
7
Views
2K
Proof by mathematical induction
  • · Replies 4 ·
Replies
4
Views
2K
Discrete logs and non generators
  • · Replies 4 ·
Replies
4
Views
1K
Strong Induction: Proving Every Int n>1 is a Product of Primes
  • · Replies 5 ·
Replies
5
Views
2K