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

It is currently 18 Jul 2018, 01:54

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

In how many ways can two integers m and n, with m > n, be selected fro

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

Hide Tags

Expert Post
Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 5839
GMAT 1: 760 Q51 V42
GPA: 3.82
Premium Member
In how many ways can two integers m and n, with m > n, be selected fro [#permalink]

Show Tags

New post 19 Mar 2018, 02:15
00:00
A
B
C
D
E

Difficulty:

  35% (medium)

Question Stats:

73% (01:25) correct 27% (01:28) wrong based on 52 sessions

HideShow timer Statistics

[GMAT math practice question]

In how many ways can two integers \(m\) and \(n\), with \(m > n\), be selected from the whole numbers from \(12\) to \(32\), inclusive?

\(A. 150\)
\(B. 180\)
\(C. 190\)
\(D. 210\)
\(E. 240\)

_________________

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"

BSchool Forum Moderator
User avatar
V
Joined: 26 Feb 2016
Posts: 2939
Location: India
GPA: 3.12
Premium Member
In how many ways can two integers m and n, with m > n, be selected fro [#permalink]

Show Tags

New post 19 Mar 2018, 02:25
MathRevolution wrote:
[GMAT math practice question]

In how many ways can two integers \(m\) and \(n\), with \(m > n\), be selected from the whole numbers from \(12\) to \(32\), inclusive?

\(A. 150\)
\(B. 180\)
\(C. 190\)
\(D. 210\)
\(E. 240\)


There are \(21(32 - 12 + 1)\) integers between 12 and 32.

Since the integers, m and n need to be selected from the 21 numbers available,
there are a total of 21*20 ways of choosing these integers.

Of these integers, half the possibilities satisfy the condition m > n.
Therefore, there are \(\frac{21*20}{2} = 210\) ways of selecting these integers (Option D)

_________________

You've got what it takes, but it will take everything you've got

Expert Post
Top Contributor
1 KUDOS received
CEO
CEO
User avatar
P
Joined: 12 Sep 2015
Posts: 2633
Location: Canada
Re: In how many ways can two integers m and n, with m > n, be selected fro [#permalink]

Show Tags

New post 19 Mar 2018, 08:15
1
Top Contributor
MathRevolution wrote:
[GMAT math practice question]

In how many ways can two integers \(m\) and \(n\), with \(m > n\), be selected from the whole numbers from \(12\) to \(32\), inclusive?

\(A. 150\)
\(B. 180\)
\(C. 190\)
\(D. 210\)
\(E. 240\)


A nice rule says: the number of integers from x to y inclusive equals y - x + 1
32 - 12 + 1 = 21
So, there are 21 numbers from which to choose

NOTE: the order in which we select the numbers does not matter because, once we have selected the 2 numbers, we'll let m equal the larger value (to maintain the condition that m > n)
Since order does not matter, we can use combinations.
We can select 2 numbers from 21 numbers in 21C2 ways
21C2 = (21)(20)/(2)(1) = 210

Answer: D

RELATED VIDEO - calculating combinations (like 21C2) in your head

_________________

Brent Hanneson – Founder of gmatprepnow.com

Image

Expert Post
Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 5839
GMAT 1: 760 Q51 V42
GPA: 3.82
Premium Member
Re: In how many ways can two integers m and n, with m > n, be selected fro [#permalink]

Show Tags

New post 21 Mar 2018, 02:51
=>

Since the order of \(m\) and \(n\) is fixed, we only need to count the number of ways to choose \(2\) numbers from \(12, 13, …, 32.\)

We have \(21\) numbers to choose from since \(32 – 12 + 1 = 21.\)

The number of selections is
\(21C2 = \frac{(21*20)}{(1*2)} = 210.\)

Therefore, D is the answer.

Answer: D
_________________

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"

Re: In how many ways can two integers m and n, with m > n, be selected fro   [#permalink] 21 Mar 2018, 02:51
Display posts from previous: Sort by

In how many ways can two integers m and n, with m > n, be selected fro

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

Events & Promotions

PREV
NEXT


cron

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