atova01
BrushMyQuant
Find the sum of all three digit numbers which leave a remainder 2 when divided by either 7 or 5Three digit numbers which will satisfy the condition will be
2 + Multiple of LCM(5,7)= 2 + 35k (where k is an integer)
First number = 107 (As 107 = 35*3 + 2)
Last Number = 982
Common difference, d = 35
Number of terms, n = (Last term - First Term)/d + 1 = \(\frac{982 - 107}{35}\) + 1 = 25 + 1 = 26
Sum = n * (First Term + Last Term)/2 = 26 * \(\frac{(107 + 982)}{2}\) = 14,157
So,
Answer will be BHope it helps!
Watch the following video to MASTER Sequence problems
Hello - what is the fastest/ easiest way to find the last number aka the 982?
Start with 1000. Number will leave a reminder of 2 when divided by 5 and 7Looking at multiples of 5 is easier so we know that units digit will be 0 or 5.
So, we need to look at numbers which are multiples of 7 and which have a units digit of 0 or 5.
Start with 995 and then try 990, 985, 980 to eventually land at 980.
980 is divisible by both 5 and 7. So , add the remainder of 2 to get 982 as the number.
Other method is using 35k + 2. We are looking at 1000 as the max number.
35*30 will be around 1000, 1050 to be exact
But 1050 + 2 (1052) > 1000
So start subtracting 35 from it
1052 - 35 > 1000
=> 1052 - 70 = 982 is the number