GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 24 Sep 2018, 06:55

Close

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel

Is m divisible by n?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 49417
Is m divisible by n?  [#permalink]

Show Tags

New post 22 Dec 2016, 02:31
00:00
A
B
C
D
E

Difficulty:

  35% (medium)

Question Stats:

67% (00:49) correct 33% (01:24) wrong based on 135 sessions

HideShow timer Statistics

Senior Manager
Senior Manager
avatar
B
Joined: 13 Oct 2016
Posts: 367
GPA: 3.98
Re: Is m divisible by n?  [#permalink]

Show Tags

New post 22 Dec 2016, 03:57
2
1
(1) mn/2 is divisible by n

\(\frac{mn}{2}\) is a multiple of n. \(\frac{mn}{2n}\) = \(\frac{m}{2}\)

This does not give us any information about divisibility of m by n. Insufficient.

(2) m + n is divisible by n

\(\frac{m + n}{n}\) = integer ----> \(\frac{m + n}{n} = \frac{m}{n} + \frac{n}{n} = \frac{m}{n} + 1\)

In order fo that expression to be an integer \(\frac{m}{n}\) should be an integer. Sufficient.

B
Intern
Intern
avatar
S
Joined: 10 Jun 2016
Posts: 49
Schools: IIM-A"19
Re: Is m divisible by n?  [#permalink]

Show Tags

New post 27 Feb 2017, 14:46
My Thinking.

S-1) Not sufficient as clearly no information about m. From S-1 we can derive mn/2 = nk where k is integer.
So mn = 2nk, so m = 2k means m is integer. My way of thinking. Correct me if I am wrong. No information about m/n. So not sufficient.

S-2) m+n = n*k
Trying alternative to Arithmetic
Say m = 1 and n = 1 then 1+1/ 1 = k sufficient
m = 4, n = 2 then 4+2/2 = Integer. Sufficient

m = 3, n = 2 then 3+2/2 = Not integer as this violates S-2 it is not a valid statement. So Statement 2 is sufficient. Though I answer this as B, I still feel the alternative approach is not 100%. Any gaps anyone can highlight in my thinking.
_________________

Thank You Very Much,
CoolKl
Success is the Journey from Knowing to Doing

A Kudo is a gesture, to express the effort helped. Thanks for your Kudos.

Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 6239
GMAT 1: 760 Q51 V42
GPA: 3.82
Premium Member
Re: Is m divisible by n?  [#permalink]

Show Tags

New post 24 Mar 2018, 18:38
Bunuel wrote:
Is m divisible by n?

(1) mn/2 is divisible by n
(2) m + n is divisible by n.


Forget conventional ways of solving math questions. For DS problems, the VA (Variable Approach) method is the quickest and easiest way to find the answer without actually solving the problem. Remember that equal numbers of variables and independent equations ensure a solution.

Since we have 2 variables (m and n) and 0 equations, C is most likely to be the answer. So, we should consider conditions 1) & 2) together first. After comparing the number of variables and the number of equations, we can save time by considering conditions 1) & 2) together first.

Conditions 1) & 2)
m + n = nk from the condition 2).
m = (k-1)n
Thus, both conditions together are not sufficient.

Since this question is an integer question (one of the key question areas), CMT (Common Mistake Type) 4(A) of the VA

(Variable Approach) method tells us that we should also check answers A and B.

Condition 1)
If m = 2, n = 2, the answer is 'yes'.
If m = 2, n = 3, the answer is 'no'.
Thus the condition 1) is not sufficient.

Condition 2)
m + n = nk from the condition 2).
m = (k-1)n
Thus, the condition 2) is sufficient.

Therefore, the answer is B.

Normally, in problems which require 2 equations, such as those in which the original conditions include 2 variables, or 3 variables and 1 equation, or 4 variables and 2 equations, each of conditions 1) and 2) provide an additional equation. In these problems, the two key possibilities are that C is the answer (with probability 70%), and E is the answer (with probability 25%). Thus, there is only a 5% chance that A, B or D is the answer. This occurs in common mistake types 3 and 4. Since C (both conditions together are sufficient) is the most likely answer, we save time by first checking whether conditions 1) and 2) are sufficient, when taken together. Obviously, there may be cases in which the answer is A, B, D or E, but if conditions 1) and 2) are NOT sufficient when taken together, the answer must be E.
_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only $99 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"

e-GMAT Representative
User avatar
P
Joined: 04 Jan 2015
Posts: 2014
Re: Is m divisible by n?  [#permalink]

Show Tags

New post 26 Mar 2018, 10:49

Solution:



To find:

    • If m is divisible by n or not.

      o Inference: if m is divisible by n, m should be a multiple of n.

         This means, m can be represented in the form of: nx, where x is any positive integer.

Working out:

Statement 1:

mn/2 is divisible by n

This means, we can write mn/2 as a multiple of n

Translating the above statement in the mathematical form, we get:

\(mn/ 2 = nK\), where K is a positive integer.

Dividing both the sides of this equation by n, we get:

\(m/2 = K\)

or, \(m =2K\).

Since m is not of the form of nx, Statement 1 alone is not sufficient to answer this question.

Statement 2:

m + n is divisible by n

    • From this statement, we can write that m+n = nK, where K is any positive integer.
Dividing both the sides of this equation by n, we get:

    •\(m/n + 1 = K\)

Since K is an integer, and 1 is also an integer, m/n has to be an integer.

    • Or, m/n can be written as y, where y is any integer.

    • Thus, m/n = y, Or m = y*n

Since m can be represented in the form of n*a positive integer, m is divisible by n.

Hence, Statement 2 alone is sufficient to answer our question.

Answer: Option B
_________________








Register for free sessions
Number Properties | Algebra |Quant Workshop

Success Stories
Guillermo's Success Story | Carrie's Success Story

Ace GMAT quant
Articles and Question to reach Q51 | Question of the week

Must Read Articles
Number Properties – Even Odd | LCM GCD | Statistics-1 | Statistics-2
Word Problems – Percentage 1 | Percentage 2 | Time and Work 1 | Time and Work 2 | Time, Speed and Distance 1 | Time, Speed and Distance 2
Advanced Topics- Permutation and Combination 1 | Permutation and Combination 2 | Permutation and Combination 3 | Probability
Geometry- Triangles 1 | Triangles 2 | Triangles 3 | Common Mistakes in Geometry
Algebra- Wavy line | Inequalities

Practice Questions
Number Properties 1 | Number Properties 2 | Algebra 1 | Geometry | Prime Numbers | Absolute value equations | Sets



| '4 out of Top 5' Instructors on gmatclub | 70 point improvement guarantee | www.e-gmat.com

GMAT Club Bot
Re: Is m divisible by n? &nbs [#permalink] 26 Mar 2018, 10:49
Display posts from previous: Sort by

Is m divisible by n?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  

Events & Promotions

PREV
NEXT


Copyright

GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.