IMPORTANT: When it comes to remainders, we have a nice rule that says:
If N divided by D leaves remainder R, then the possible values of N are R, R+D, R+2D, R+3D,. . . etc.
For example, if k divided by 5 leaves a remainder of 1, then the possible values of k are: 1, 1+5, 1+(2)(5), 1+(3)(5), 1+(4)(5), . . . etc.

Let's start with the second piece of information...
The remainder is 5 when the number is divided by 6
So, the possible values are: 5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95,... (we'll stop here, since the questions specifies that the number is a 2-digit number)

The remainder is 1 when the number is divided by 10
So, the possible values are: 1, 11, 21, 31,...
Notice this this basically tells us that the number has a UNITS DIGIT of 1

So, go back to examine the first set of possible values: {5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95}
3 values have a UNITS DIGIT of 1

So, there are 3 values that satisfy both conditions.
Answer: A

RELATED VIDEO FROM OUR COURSE

_________________

2 digit numbers whose remainder when divided by 10 is 1 are
11 , 21 , 31 , 41 , 51 , 61 , 71 , 81 , 91
Out of above , numbers whose remainder when divided by 6 is 5 are
11 , 41 and 71

Answer A
_________________

Of all the 2-digit numbers that have a remainder of 1 when divided by 10, only 11, 11 + LCM(6, 10) = 11 + 30 = 41, and 41 + 30 = 71, when divided by 6, yield a remainder of 5.

Answer: A
_________________

Isn’t GCF(6,10) 2 how did you get to 30?

I tried the n=24x + …. But I can’t find the value of …
Could someone please advise? Thanks
_________________

We actually meant LCM(6, 10) instead of GCD(6, 10); you're absolutely right that GCD(6, 10) is 2. Thanks for pointing it out.

If the "n" in your equation represents a two digit number that produces a remainder of 1 when divided by 10 and a remainder of 5 when divided by 6; I don't think you'll be able to find the numbers using any equation of the sort n = 24x + ... You can proceed as follows in order to find the numbers that way:

Since n produces a remainder of 1 when divided by 10, n = 10k + 1 for some k.

Since n produces a remainder of 5 when divided by 6, n = 6s + 5 for some s.

Let's add 19 to each equation:

n + 19 = 10k + 20

n + 19 = 6s + 24

Notice that 10k + 20 is divisible by 10 and 6s + 24 is divisible by 6. Since n + 19 is both divisible by 10 and by 6, n + 19 must be divisible by the LCM of 10 and 6, which is 30. Thus, the smallest possible value of n + 19 is 30; which yields the smallest possible value of n is 30 - 19 = 11.

Once we find the smallest possible value of n, we can just add LCM of 6 and 10 to find other two digit numbers which satisfy the requirements of the question; the numbers are 11, 11 + 30 = 41 and 41 + 30 = 71.
_________________

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.
_________________