Step 1: Write the number in terms of a and b. The number abbb can be expressed as:
N = 1000a + 100b + 10b + b = 1000a + 111b.
Step 2: Condition for divisibility by a. For N to be divisible by a, the remainder when N is divided by a must be 0:
N = 1000a + 111b => 111b must be divisible by a.
Step 3: Simplify the condition. Since 1000a is always divisible by a, the divisibility condition reduces to:
111b must be divisible by a.
This means b must be divisible by a.
Answer: Option 2.
Directions: In Question Numbers 19 and 20, a statement of Assertion (A) is followed by a statement of Reason (R).
Choose the correct option from the following:
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
(B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
(C) Assertion (A) is true, but Reason (R) is false.
(D) Assertion (A) is false, but Reason (R) is true.
Assertion (A): For any two prime numbers $p$ and $q$, their HCF is 1 and LCM is $p + q$.
Reason (R): For any two natural numbers, HCF × LCM = product of numbers.
A | B | C | D | Average |
---|---|---|---|---|
3 | 4 | 4 | ? | 4 |
3 | ? | 5 | ? | 4 |
? | 3 | 3 | ? | 4 |
? | ? | ? | ? | 4.25 |
4 | 4 | 4 | 4.25 |