by euclids division lemma show that 2 consecutive integers are divisible by 2
Answers
Answered by
0
Answer:
Similarly, when a number is divided 2, the remainder obtained is 0 or 1. ∴ n = 2q or 2q + 1, where q is some integer. If n = 2q ⇒ n and n + 2 = 2q + 2 = 2(q + 1) are divisible by 2.
Step-by-step explanation:
Similar questions