- A18
- B9
- C8
- D10
Step-by-Step Solution
Writing or , exactly one of is a multiple of 3. For : 7, 9, 11 -> 9 is divisible by 3.
Answer: B) 9
Show that one and only one out of n, n+2, n+4 is divisible by 3.
For n = 7, exactly one of 7, 9, 11 is divisible by 3. Which one is it?
Class 10Euclid's Division LemmaNumber Systems
Master this chapter in 30 minutes a day.
Don't just memorise the answer — build a daily practice habit.
Practice 5 Similar Questions Free →All Euclid's Division Lemma practice questions
More Class 10 Euclid's Division Lemma practice
Find the largest number that divides 398, 436 and 542 leaving remainders 7, 11 and 15…Using Euclid's algorithm, HCF(a, b) = HCF(b, r) where a = bq + r. If HCF(1620, 1725) is…Find the largest number which divides 626, 3127 and 15628 leaving remainders 1, 2 and 3…Euclid's Division Lemma states that for positive integers a and b, there exist unique…In Euclid's Division Lemma a = bq + r, the integer b is called the: