Answer VerifiedHint: Here we will use the concept of the LCM. Firstly we will find the LCM of all the divisors i.e. 15, 25 and 35. Then we will see the pattern of getting the remainder by observing the difference between the divisor and the remainder. Then we will subtract the observed difference from the LCM of all the divisors to get the required value. Complete step-by-step answer: First, we will find the LCM of the divisors of the number i.e. 15, 25 and 35. Therefore, we get
So, option A is the correct option. Note: Remainder is the value of the left over when a number is not exactly divisible by the other number. Zero is the remainder when a number exactly divides the other number. In addition, we should know how to find the LCM (Least Common Multiple) of the numbers. LCM is the smallest positive integer that is divisible by the numbers. Here we should note that HCF is the short form of highest common factor which is the largest factor which is the largest common divisor of both the numbers.Given: Dividend = 5, 6 and 8 The remainders in each case = 2 Formula used: The least number when divide by let x, y and z, if remainder comes in each case is k then, The least number = n × Least common multiple of (x, y and z) + k where n is an integer. Calculation: A least common multiple of 5, 6 and 8 LCM of 5, 6 and 8 = 4 × 2 × 3 × 5 ⇒ 120 Least number = n × 120 + 2, where n are 1, 2, 3 etc. But we have to find a least four-digit number for this we can take the value of n after multiply with 120 which close to the least four digits 1000 And we take n=9 Least number = 9 × 120 + 2 ⇒ 1080 + 2 ⇒ 1082 ∴ Our least number will be 1082. For the above type of question go with the option directly by dividing each option with the respective number and check which option gives the remainder 2 that option will be our answer. Let us pick option 4, After dividing 5 remainder comes = 2 After dividing 6 remainder comes = 2 And after dividing 8 remainder comes = 2 so in each case remainder satisfied with the chosen option so our answer will be option 1. ∴ Our least number will be 1082. |