The remainder when positive integer N is divided by 2 is 1, when divid

Ans: C
as it is given that number N leaves reminder of 4 when divided by 5 so : Number must be= 5i+4 where i is an int.
now. we get values of possible N by putting i= 1,2,3,4,5.. and so on.
Possibilities: N= 9, 14,19,24,29,34,39 and so on.
but as given number is not divisible by 2 and 3 so we will lest out the even numbers and multiple of 3 from the list which will leave us possible N= 19, 29, 49, 59, 79.. and so on..
now just follow the conditions and divide these by 2,3,4 and check for reminders. 59 fulfill it. so sum of the digits is5+9=14.
Ans : 14

let x=difference between first two quotients:
x=(n-1)/2-(n-2)/3➡(n+1)/6
thus, n+1 is multiple of 6
let y=difference between last two quotients:
y=(n-3)/4-(n-4)/5➡(n+1)/20
thus, n+1 is a multiple of 20
if n+1 is a multiple of 20 and 6,
then least possible value of n=59
5+9=14
C

The best way to solve this is -

Any number divisible by 5 ends with 0 or 5. Numbers ending with 0 are divisible by 2, hence, we need to consider number ending with 5 + 4. For Ex - 9, 19,29,39,49,59,69,79.. etc.

So, minimum would be 59.

Solved this using substituting values

Constraint 1:
The number should not be divisible by 2,3 or 4. So this removes any even number from contention.

Constraint:
When divided by 5, the remainder should be 4. So the number cannot end in 1, 6, 7. Also number cannot end in 0.

From the above 2 constraints , we get that number should end in 9. But at the same time cannot be divisible by 3.

The options are 19,29,39,49,59,69,79,89,99. Out of these numbers
39,69 and 99 are divisible by 3.
19, 49,79 - gives remainder of 1 when divided by 3.
29 - Remainder 1 when divided by 4

59 is the option left which satisfied all constraints. When the digits are added , gives 5+9=14

Ans : C

Let’s use the last condition first: when N is divided by 5, the remainder is 4. The reason is: 5 is the largest divisor here, so if we list the numbers that satisfies this condition, the numbers will increase faster than those of the other three conditions. Recall that if the remainder is 4 when a number is divided by 5, the units digit must be either 4 or 9. However, it cannot be 4 since we are told that there is a remainder of 1 when the N is divided by 2. Now let’s list the numbers:

9, 19, 29, 39, 49, 59, 69, …

We can also omit the numbers 9, 39, 69, etc. since these numbers are divisible by 3 (we are given that N is not divisible by 3). So we are left with:

19, 29, 49, 59, 79, 89, …

We see that all of these numbers have a remainder of 1 when divided by 2, so let’s check division by 3 and 4:

19/3 = 6 R 1…. No

29/3 = 9 R 2…. Yes; 29/4 = 7 R 1 …. No

49/3 = 16 R 1 …. No

59/3 = 19 R 2…. Yes; 59/4 = 14 R …. Yes

Thus 59 is the least possible value of N and 5 + 9 = 14.

Alternate solution:

Notice that each remainder is the largest possible remainder of their respective divisor (for example, 3 is the largest possible remainder when a number is divided by 4). Therefore, if we can the find a number that has remainder of 0 when it’s divided by 2, 3, 4 and 5, and then subtract 1 from it, we will have a suitable value for N. Since we want the least possible value of N, we want to find the smallest positive integer that is divisible by 2, 3, 4 and 5. This number is, of course, the least common multiple of the 4 numbers and it is:

LCM(2, 3, 4, 5) = LCM(2, 3, 2^2, 5) = 2^2 x 3 x 5 = 60.

Since 60 is the LCM of (2, 3, 4, 5), 60 - 1 = 59 is the least possible value of N. Let’s verify it:

59/2 = 29 R 1; 59/3 = 19 R 2; 59/4 = 14 R 3 and 59/5 = 11 R 4.

Thus the sum of the digits of N = 5 + 9 = 14.

Answer: C

Hello,
Would you please tell me where I can find this rule: N= lcm Q + Constant R?

Thank you very much

Jetmat

pushpitkc hello there
on what rule is this statement based ? can you pls explain ?
Recall that if the remainder is 4 when a number is divided by 5, the units digit must be either 4 or 9.

pushpitkc does the below in red mean that since the DIFFERENCE between each divisor and each remainder is 1, we need to subtract 1 from LCM of divisor ? can you please elaborate on this ? thanks!

Notice that each remainder is the largest possible remainder of their respective divisor (for example, 3 is the largest possible remainder when a number is divided by 4). Therefore, if we can the find a number that has remainder of 0 when it’s divided by 2, 3, 4 and 5, and then subtract 1 from it, we will have a suitable value for N

Hey dave13

Let's consider some examples of numbers which give us a remainder of 4 when divided by 5

One of the options is when the number ends with 4 itself - 4,14,24.....
Another option is when the number ends with 9 - 9,19,29.....
(each of these options, when divided by 5, will yield a remainder of 4)

Unfortunately, there is no RULE for this - you will need to use the PATTERN method
in order to understand which of the numbers give us a remainder of 4.

Hope that helps you!

Hi....
can you please expand on the bolded part and explain on how you recognized this?

Hello Mansoor50,

I'll try to explain the bold part by touching upon the basics of remainders and remainder theorem.

The remainder when any positive integer is divided by a divisor has to be non-negative and less than the divisor. This is the basic rule for remainders.
For e.g Remainders of:
1) 3/3 = 0
2) 4/3 = 1
3) 5/3 = 2
...we cannot have a remainder of 3, as remainder has to be less than divisor as discussed.

Now what does it mean to have a negative remainder?
Take a look at the below examples, when we apply the remainder theorem formula of Dividend = (Divisor * Quotient) + Remainder
1) N=3a - 1 (....means that when N is divided by 3, it leaves a remainder of -1).
However, we know that remainder cannot be negative. So we rewrite -1 as the difference of 2 numbers, so that upon expansion, we get a positive remainder
i.e N=3a-[3-2]......further expansion, we get....N=3a-3+2 .....and still further N=3(a-1)+2.....now notice that 3(a-1) is divisible by 3. And 2 divided by 3 gives a remainder of 2.

If you understand the above, then you'll notice that negative remainders can be converted to "equivalent" positive remainders by subtracting the negative remainder from the divisor.
As we saw, when divisor is 3 and remainder is -1, the equivalent positive remainder is (3-1) = 2.
And if remainder is -2, then the corresponding remainder will be (3-2) = 1

Converse is also true.... i.e when remainder is 2 and divisor is 3...the corresponding negative remainder is 2-3, i.e -1.
You can check this with any combinations...say remainder is 5 when you divide a number by 8...therefore it's corresponding negative remainder will always by (5-8) = -3
Or when remainder is 7 when you divide a number by 8, it's corresponding negative remainder will always be (7-8) = -1
The -1 remainder concept helps solve several GMAT remainder problems like this one, because simply put, whenever the remainder is exactly 1 less than the divisor, it means remainder is -1.

Hope it is clear now.

thank you!!!

N can be equated to below

N = 2a-1
N=3b-1
N=4c-1
N=5d-1

Hence, N = a* LCM of (2, 3, 4 & 5) - 1

N= 60a-1

For least value of N, a should be least,, i.e.. 1

So, N = 59

Sum of digits = 14.

OA: C

Why is this true?

"Therefore, the least value of number N = lcm (2, 3, 4, 5) – 1". The first coinciding number is always the LCM-1?

Let's assume N is two digit number, with unit digit as b and tenth digit as a

=> ab = N
=> a+b = Answer options
A) a+b = 11 => (29),(92),(83),(38),(47),(74),(65),(56)
reject multiples of 2 & 5
left-->29,83,47
None of them leaves remainder 4 when divided by 5,so Reject A.

B)a+b = 13=> 94,49,85,58,76,67
reject multiples of 2 & 5
left-->49,67
None of them leaves remainder 4 when divided by 5, so reject B.

C) a+b = 14 => 95,59,86,68,77
reject multiples of 2 & 5
left--> 59 & 77
77 leaves remainder of 2 when divided by 5.
59 satisfies all the conditions. Hold.

D) a+b = 16 => 97,79,88
reject multiples of 2
left--> 97,79
97 leaves remainder of 2 when divided by 5.
79 leaves remainder of 1 when divided by 3.
Reject D

E) a+b = 17 => 98,89
reject multiple of 2
left- 89
89 leaves remainder of 2 when divided by 4.
Reject E.

=> Answer is C.
**Since we need to find the least possible value, there is no need to check 3 digit possible values of n.

Given: The remainder when positive integer N is divided by 2 is 1, when divided by 3 is 2, when divided by 4 is 3, and when divided by 5 is 4.

Asked: What is the sum of the digits of the least possible value of N?

N = 2k + 1 = 3m + 2 = 4n + 3 = 5p + 4

N is odd; p is odd; m is odd

N - 1 = 2k = 3m + 1 = 4n + 2 = 5p + 3
k = 2n + 1
3m + 1 = 5p + 3
3m = 5p + 2
p = (3m - 2)/5

(m, p) = {(4,2), (9,5), (14,8),(19,11),...}
N = 14, 29, 44 are not possible
N = 59 = 2*29 + 1 = 3*19+2 = 4*14 + 3 = 5*11 + 4

Least possible value of N = 59
Sum of digits of least possible value of N = 5+9 = 14

IMO C

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.