Sum
Find all positive integers, when divided by 3 leaves remainder 2
Advertisement Remove all ads
Solution
All the positive integers when divided by 3 leaves remainder 2
By Euclid’s division lemma
a = bq + r, 0 ≤ r ≤ b
Here a = 3q + r where 0 < q < 3
a leaves remainder 2 when divided by 3
∴ The positive integers are 2, 5, 8, 11, …
Concept: Euclid’s Division Lemma
Is there an error in this question or solution?
Advertisement Remove all ads
APPEARS IN
Advertisement Remove all ads
Advertisement Remove all ads