Find the least number which when divided by 6, 7, 8, 9 and 10 leaves 1, 2, 3, 4 and 5 as remainders respectively, but when divided by 19 leaves no remainder?
Correct answer: D. 5035
- A. 5073
- B. 5016
- C. 5054
- D. 5035
Explanation
The remainders are one less than the divisors, so n + 5 must be divisible by 6, 7, 8, 9 and 10. Their least common multiple is 2520, hence n = 2520k - 5; requiring divisibility by 19 gives k = 2 as the least positive solution, so n = 5040 - 5 = 5035. The likely mistake is option a, which has the required pattern for the first divisors but is not divisible by 19.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? [email protected]
About Sequences and Series
Sequences describe ordered terms formed by a pattern, while series represent the sum of those terms. Questions cover arithmetic and geometric sequences, their nth terms, common difference or ratio, finite sums, and applications, with the sequence itself kept distinct from the corresponding series.
Practise Algebra
269 free Algebra MCQs from Mathematics, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Discussion
Stuck on an option, or know a faster way to get there? Ask or explain it here.
No comments yet. Be the first to explain this one.
Exams that ask Mathematics questions like this
Mathematics is on 76 papers prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for every one of them.
More Sequences and Series questions
Find the least multiple of 13 which when divided by 6, 8 and 12 leaves 5, 7 and 11 as remainders respectively? A. 143 B. 169 C. 260 D. 221
Find the least square number which is divisible by 10, 12, 15 and 18?
2003 * 2004 - 2001 * 2002 = _________?
Find the least number which when divide by 2, 3, 4, 5 and 6 leaves 1, 2, 3, 4 and 5 as remainders respectively, but when divided by 7 leaves no remainder?
A heap of stones can be made up into groups of 21. When made up into groups of 16, 20, 25 and 45 there are 3 stones left in each case. How many stones at least can there be in the heap?
Find the greatest number of four digits which when divided by 10, 15, 21 and 28 leaves 4, 9, 15 and 22 as remainders respectively?