Board logo

标题: [备考攻略] GMAT Tip | Quantitative Intimidation [打印本页]

作者: carry    时间: 2018-10-25 15:17     标题: GMAT Tip | Quantitative Intimidation

The biggest challenge that we hear from students is not necessarily how to factor algebra questions or solve for the area of a circle, but rather, even being able to figure out the first step in solving a data sufficiency or problem solving question.

Once that first step is determined, the next steps fall into place, and for some test takers, from there it is just a matter of efficiency. But, how really do we figure out that very first step?

In today’s post we’ll start with one huge helpful tip:

Dissecting a word problem, line-by-line, or simplifying an equation often gives us the confidence we need to push the envelope further. Take this question, for example:

There are 8 books in a shelf that consist of 2 paperback books and 6 hardback books. If 4 books are selected at random without replacement, how many different combinations are there that at least one paperback book is selected?

A. 40
B. 45
C. 50
D. 55
E. 60

This is a classic “at least” combination problem that spins many test takers into a frenzy. How in the world are you supposed to figure out such a complex combination problem in two short minutes?

Breaking up the question, piece by piece, can help us get organized to how we are going to tackle this problem.

Total number of books = 8

Total number of paperback books = 2

Total number of hardback books = 6

What is the question being asked?

Ah, we feel better already – don’t you? In looking at our set-up, hopefully we’ve realized that there are only two paperback books, so the amount of combination calculations we have to make is ½ of what we probably anticipated at first read.

From there, we should know that there are likely a couple different ways we can sold this problem.

The route most test takers will select is:

Total numbers of combinations that have 2 paperback + total number of combinations that have 1 paperback = the total combinations that have at least one paperback

= 2C2 * 6C2 + 2C1 * 6C3
= 15 + 40
= 55 ways

Super easy, right? An even easier way to setup this problem is to say:

Number of combinations which have at least one paperback is found by finding the total number of combinations minus total number of combinations in which there is no paperback:

= 8C4 – 6C4
= 55 ways

Most “at least” problems are easier found by looking at the Total – None to find the number of combinations.

But, the key thing to recognize here is that by writing out what we know and organizing our information, the right answer becomes much easier to calculate that we projected.

So, starting by writing out what you know is an excellent strategy for “just getting started.” Check-in next where we tackle our next tip – having a “running checklist.”


作者: xicheng    时间: 2018-11-9 11:48

看一看~
作者: Game    时间: 2018-11-27 11:04

Mark   Mark
作者: undergo    时间: 2018-12-7 17:29

谢谢楼主的分享
作者: Janceser    时间: 2018-12-19 10:35

thanks.....
作者: yancony    时间: 2018-12-28 18:30


作者: Smash    时间: 2019-1-14 13:27

赞一个!
作者: Ganger    时间: 2019-1-28 14:36

O(∩_∩)O谢谢...
作者: Karry    时间: 2019-2-21 15:37

看一眼...
作者: Satrica    时间: 2019-3-8 12:29

Thanks♪(・ω・)ノ
作者: Yoney    时间: 2019-3-25 11:17

O(∩_∩)O谢谢...
作者: colony    时间: 2019-4-11 12:44

看看……
作者: Pandaa    时间: 2019-4-22 15:50

赞一个赞一个...
作者: unable    时间: 2019-4-30 13:27


作者: opinion    时间: 2019-5-10 16:33

mark一下!
作者: Gradual    时间: 2019-5-21 12:07

赞一赞~
作者: Ronan    时间: 2019-5-30 11:51

谢谢分享...
作者: Enterprise    时间: 2019-6-11 17:01

看看看...
作者: Mondt    时间: 2019-6-19 09:18

谢谢分享……
作者: Smash    时间: 2019-6-26 17:54

mark    mark
作者: Migraine    时间: 2019-7-3 14:41

thanks……
作者: Facem    时间: 2019-7-11 11:55

顶一顶!
作者: Inaeven    时间: 2019-7-19 14:09

mark    mark
作者: Trancy    时间: 2019-7-26 16:57

谢谢分享~
作者: Library    时间: 2019-8-6 16:14

thanks...
作者: yuyi    时间: 2019-8-15 10:37

thanks...
作者: Cycles    时间: 2019-8-23 14:00

顶一顶.....
作者: fataly    时间: 2019-9-3 18:11

O(∩_∩)O谢谢~
作者: kingring    时间: 2019-9-12 11:04

顶一顶……
作者: Cadd    时间: 2019-9-23 10:29

谢谢分享...
作者: Conden    时间: 2019-9-30 16:34

顶一顶....
作者: Amyliu    时间: 2019-10-15 14:03

mark   mark
作者: Kindredd    时间: 2019-10-24 16:10

谢谢...
作者: Ronge    时间: 2019-11-5 10:49

thanks!
作者: Yingyu    时间: 2019-11-14 18:06

thanks...
作者: feckless    时间: 2019-11-26 10:13

thx!!!
作者: 冲刺    时间: 2019-12-6 12:24

thanks....
作者: Ganceny    时间: 2019-12-17 16:45

谢谢分享......
作者: trice    时间: 2019-12-30 09:44

谢谢分享~
作者: Laborious    时间: 2020-1-13 08:47

顶一顶……
作者: Damet    时间: 2020-2-5 09:55

thanks.....
作者: Combat    时间: 2020-2-14 14:23

Mark一下……
作者: Montain    时间: 2020-2-28 10:47

thanks~
作者: chobitS若    时间: 2020-12-18 10:07

mark
作者: tanglu18    时间: 2020-12-22 09:52

3x
作者: Diego20    时间: 2021-1-1 09:59

谢谢
作者: sharonlu    时间: 2021-2-6 11:24

谢谢
作者: ljy1902    时间: 2021-3-21 15:38

THANKS
作者: marcox    时间: 2021-3-30 15:59

mark
作者: MikeHunb    时间: 2021-4-1 10:28

thanks
作者: zihui09    时间: 2021-4-13 09:55

谢谢
作者: DoKn    时间: 2021-4-20 09:34

3X




欢迎光临 国际顶尖MBA申请交流平台--TOPWAY MBA (http://forum.topway.org/) Powered by Discuz! 7.2