Proof That an Integer is Divisible by 2

  • Thread starter Thread starter Math100
  • Start date Start date
  • Tags Tags
    Integer Proof
Click For Summary
SUMMARY

This discussion establishes the proof that an integer N is divisible by 2 if and only if its units digit x is one of {0, 2, 4, 6, 8}. The proof utilizes modular arithmetic, specifically showing that since 10k is congruent to 0 modulo 2, N's divisibility by 2 is equivalent to the parity of its units digit. The conclusion is that both directions of the divisibility condition are valid, confirming the criteria for even integers.

PREREQUISITES
  • Understanding of modular arithmetic
  • Familiarity with integers and their properties
  • Basic knowledge of proofs in mathematics
  • Concept of units digit in decimal representation
NEXT STEPS
  • Study modular arithmetic in depth, focusing on congruences
  • Explore properties of even and odd integers
  • Learn about mathematical proofs and logical equivalences
  • Investigate divisibility rules for other integers beyond 2
USEFUL FOR

Mathematics students, educators, and anyone interested in number theory or proof techniques will benefit from this discussion.

Math100
Messages
817
Reaction score
230
Homework Statement
Establish the following divisibility criteria:
An integer is divisible by ## 2 ## if and only if its units digit is ## 0, 2, 4, 6 ##, or ## 8 ##.
Relevant Equations
None.
Proof:

Suppose ## N ## is the integer and ## x ## is the units digit of ## N ##.
Then ## N=10k+x ## for some ## k\in\mathbb{Z} ## where ## x={0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ##.
Note that ## 10k\equiv 0\pmod {2}\implies N\equiv x\pmod {2} ##.
Thus ## 2\mid N\implies N\equiv 0\pmod {2}\implies x\equiv 0\pmod {2}\implies x\in{0, 2, 4, 6, 8} ##.
Therefore, an integer is divisible by ## 2 ## if and only if its units digit is ## 0, 2, 4, 6 ##, or ## 8 ##.
 
Physics news on Phys.org
Math100 said:
Homework Statement:: Establish the following divisibility criteria:
An integer is divisible by ## 2 ## if and only if its units digit is ## 0, 2, 4, 6 ##, or ## 8 ##.
Relevant Equations:: None.

Proof:

Suppose ## N ## is the integer and ## x ## is the units digit of ## N ##.
Then ## N=10k+x ## for some ## k\in\mathbb{Z} ## where ## x={0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ##.
Note that ## 10k\equiv 0\pmod {2}\implies N\equiv x\pmod {2} ##.
Thus ## 2\mid N\implies N\equiv 0\pmod {2}\implies x\equiv 0\pmod {2}\implies x\in{0, 2, 4, 6, 8} ##.
Therefore, an integer is divisible by ## 2 ## if and only if its units digit is ## 0, 2, 4, 6 ##, or ## 8 ##.
Where is the other direction? You have shown ##2\,|\,N \Longrightarrow x\in \{0,2,4,6,8\}##. You must also show that all integers that end on an even digit are even themselves. Of course, you simply could replace all ##\Longrightarrow ## by ##\Longleftrightarrow##.
 
fresh_42 said:
Where is the other direction? You have shown ##2\,|\,N \Longrightarrow x\in \{0,2,4,6,8\}##. You must also show that all integers that end on an even digit is even itself. Of course you simply could replace all ##\Longrightarrow ## by ##\Longleftrightarrow##.
So should I put "Thus ## 2\mid N\Leftrightarrow N\equiv 0\pmod {2}\Leftrightarrow x\equiv 0\pmod {2}\Leftrightarrow x\in{0, 2, 4, 6, 8} ##.?
 
Math100 said:
So should I put "Thus ## 2\mid N\Leftrightarrow N\equiv 0\pmod {2}\Leftrightarrow x\equiv 0\pmod {2}\Leftrightarrow x\in{0, 2, 4, 6, 8} ##.?
Yes, the conclusions work in both directions because ##10k \equiv 0 \pmod 2## as you correctly said.
 
  • Like
Likes   Reactions: Math100

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K