N is the smallest number which is divisible by 49 and has all its digi

If this is the kind of questions the institute is passing off as GMAT questions, you really need to worry whether you (or your friend) are in the right hands. As a test maker, I can tell you that it is very easy to make hard questions. The problem lies in making simple questions which seem hard - the requirement of GMAT. The problem lies in making them GMAT relevant!

There is no logical way forward in this question. N is a multiple of 49 with all its digits same. There are innumerable numbers with all digits same - 22, 222, 2222, 3, 33, 333, 3333, 33333, 33333333 etc.

One cannot pick up a random rule and take that as starting point. We encourage people to understand logic, not learn up rules. Here, the question requires one to learn up obscure rules. Even if one does know that 6 digit numbers with all same digits will be divisible by 7, how do you know that a number such as 9999 is not divisible by 49 without calculating?

Mind you, rules can come in handy. In fact, I will give you a question I made for which this rule is relevant. But knowing the rule only hastens your solving, not knowing is not an impediment. Try this:

Question: On multiplying a positive integer N having n digits by (n + 2), we get a number with (n + 1) digits, all of whose digits are (n + 1). How many such N exist?
(A) None
(B) 1
(C) 2
(D) 8
(E) 9

There is a logical starting point here which gives you a range of only a few numbers. You ignore some of them using logic. You work on only a few and find your answer.

hi karishma, thank you very much for responding. well i'm not taking any coaching from any institute and i'm not associated with any coaching institute. usually, when we prepare for something, we tend to share our knowledge about the subject with other people. my friend has got this question, from his faculty. he put the same question to me. so, i thought of discussing the same here in this forum. i don't see any harm in doing such thing. Also, because i'm not an expert, so therefore don't know which question qualifies as gmat type and which doesn't.

well, this is definitely not some random rule. i know about these stuff and other rules, back from my olympiad days. i thought others might be aware of it, if not, then they might learn something new today.

And the answer to your question is 9.

well, here is another method to solve this question.

as all digits of the number are same. so let's start from a three digit number. 111 is not divisible by 7. since 111 is not divisible by 7, thus any three digit number having all of its digit same, except 777 will not divisible by 7. why ? because all these number will be multiple of 111 and 111 is not a factor of 7.

Also, 777=7(111). as 111 is not divisible by 7. thus 777 will not be divisible by 49.

by using the similar reasoning we can come straight to number 111111. which is divisible by 7, but not 49. thus 777777 will be our magic number.
clearly, this number is divisible by 7,3 (as sum of its digits is divisible by 3) and 11 (111111 can be written as 11,11,11). now,check the unit digit of the number obtained so far.

which is 9*3*1=7. thus we need those prime number which results in 1 in the unit digit when multiplied.(13,17,23,37 can be such numbers) let's try 13 gotcha. thus we only have to find the prime number which has 7 at its unit place. thus we will first try number 17, clearly not divisible. then we will divide the number by 37 and bingo.

as can be seen, this question can also be solved by not getting affected with savant and by not remembering any random rule.

The question is barely suitable for CAT, no matter how you do it, let alone GMAT. It is common in India to pass off the CAT questions as GMAT questions (I have worked in an institute in India so I know) since GMAT is and will remain a sidekick there - it doesn't provide enough ROI. So if you choose to ignore our advice, that's certainly your call, but in my opinion, it is worthwhile to invest your time in only GMAT specific questions if you are going to take only GMAT.

As for this question, here is the solution:

Let’s take an example to understand the question better.
"On multiplying a positive integer N having n digits by (n + 2), we get a number with (n + 1) digits, all of whose digits are (n + 1)"

Example: Let n = 3

_ _ _ × 5 = 4444

The numbers on the right hand side of the equation can only be of the form 1, 22, 333, 4444, 55555, 666666, 7777777, 88888888, 999999999 which gives us a limited set of possible options.
Looking at the example, we can find the 3 digit number, N, by dividing 4444 by 5. But since 4444 is not divisible by 5, there is no such positive integer.
Similarly, all we have to do is, using divisibility rules, divide each of these 9 numbers and see if they are divisible by their respective (n + 2)s. 1 is not divisible by 2, 22 is not divisible by 3, 333 is not divisible by 4 and so on… An odd number will never be divisible by an even number so we don’t need to check for odd numbers. So we ignore 1, 33, 55555, 7777777, 999999999

We find only 666666 is divisible by 7 giving 95338 as N. So there is only one such N.

Answer (B)

This question is at Q50/51, even though the starting point is clear, there is a small set of values and calculations involved are almost zero.

hi karishma, thanks for your reply, i made a careless mistake here. i assume that all digits of the new number are same. so end up getting 9 (from 111111 to 999999).

I'm not arguing regarding the quality of the question. i already thanked mike for his suggestion on the quality of this question. i was just trying to put forward the point that this question can be solved with more logic and less math. In my first post, i used one of the rule to solve the question and in the second solution, i only used logic nothing else.

i again, thank you karishma for being part of this discussion and giving your expert opinion, it indeed was helpful.

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.