A little question about a proof

  • Thread starter Thread starter press
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The discussion centers on using mathematical induction to prove that every integer is either even or odd. The proof is structured into two cases: Case 1 assumes n is even, leading to the conclusion that n + 1 is odd, while Case 2 assumes n is odd, resulting in n + 1 being even. The original poster questions the necessity of explicitly stating that n + 1 could also be even in Case 1. The consensus is that this explicitness is stylistic and serves to reinforce the logical structure of the proof without altering its validity.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with even and odd integers
  • Basic knowledge of logical statements and proofs
  • Ability to follow structured mathematical arguments
NEXT STEPS
  • Study the principles of mathematical induction in depth
  • Explore examples of proofs involving even and odd integers
  • Learn about the structure and components of formal mathematical proofs
  • Investigate common logical fallacies in mathematical reasoning
USEFUL FOR

Students of mathematics, educators teaching proof techniques, and anyone interested in understanding the foundations of mathematical logic and induction.

press
Messages
11
Reaction score
0

Homework Statement



Use math induction and cases to prove that every integer is even or odd.

The Attempt at a Solution



Let p(n): n is even or is odd.
Let n be an integer. Assume p(n) is true.
Then n is even or n is odd.

Case 1: Assume n is even. Then n = 2k for some integer k. So n + 1 = 2k + 1. Thus n + 1 is odd.
So, n + 1 is odd or n + 1 is even.
Hence, p(n + 1) is true.
Case 2: Assume n is odd.Then n = 2k + 1 for some integer k. So n + 1 = 2(k + 1). Thus n + 1 is even.
So, n + 1 is even or n + 1 is odd.
Hence, p(n + 1) is true.
In either case, p(n + 1) is true. So, p(n) => p(n + 1)

-------------------------------------------------------------

I copied it from the back of my book. My question is how do we know n + 1 might also be even in Case 1 before we did Case 2? Is there a logical reason for that or is it just stylistic? I am inclined to re-write this proof like this below:
...

Case 1: Assume n is even. Then n = 2k for some integer k. So n + 1 = 2k + 1. Thus n + 1 is odd.

Hence, p(n + 1) is true

Case 2: Assume n is odd.Then n = 2k + 1 for some integer k. So n + 1 = 2(k + 1). Thus n + 1 is even.

Hence, p(n + 1) is true

So, n + 1 is even or n + 1 is odd.

In either case, p(n + 1) is true. So, p(n) => p(n + 1)

------------------------------------------------------

I am reasoning like this:

p or q

Case 1: Assume p

...

Therefore r

Case 2: Assume q

...

Therefore, s.

Therefore r or s.

------------------------------------------
Please, tell me where I am tripping up.

Thanks.
 
Last edited:
Physics news on Phys.org
It is a logical truth that A => A or B. The proof doesn't need it though, it is sufficiently obvious to be omitted.
 
They are just being very precise in their proof. The statement p(n+1) means that n+1 is even or is odd. In Case 1, once you show that n+1 is odd, they want to make it extra clear that you have indeed shown that p(n+1) is true by explicitly stating it precisely: n+1 is even or is odd. Note that this is the actual exact statement of p(n+1). Then they follow it with: Hence, p(n+1) is true. They are not trying to say that p(n+1) might be even. They are including it though to match the structure of the original statement you are trying to prove. As verty stated, it is obvious enough so as to be omitted.

Junaid Mansuri
 

Similar threads

  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 49 ·
2
Replies
49
Views
5K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
4K
Replies
6
Views
3K
Replies
2
Views
3K
Replies
9
Views
3K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
6
Views
2K