GMAT Combinations with Restrictions Article
Posted on
04
Mar 2021

Combinations with Restrictions

By: Rich Zwelling, Apex GMAT Instructor
Date: 4th March, 2021

In our previous post, we discussed how GMAT combinatorics problems can involve subtracting out restrictions. However, we discussed only PERMUTATIONS and not COMBINATIONS.

Today, we’ll take a look at how the same technique can be applied to COMBINATION problems. This may be a bit more complicated, as you’ll have to use the formula for combinations, but the approach will be the same.

Let’s start with a basic example. Suppose I were to give you the following problem:

The board of a large oil company is tasked with selecting a committee of three people to head a certain project for the following year. It has a list of ten applicants to choose from. How many potential committees are possible?

This is a straightforward combination problem. (And we know it’s a COMBINATION situation, because we do not care about the order in which the three people appear. Even if we shift the order, the same three people will still comprise the same committee.)

We would simply use the combination math discussed in our Intro to Combination Math post:

                         10!
 10C3 =       ————-
                     3! (10-3!)

 

   10!
———
3! (7!)

 

10*9*8
———
3!

 

10*9*8
———
3*2*1

= 120 Combinations 

However, what if we shifted the problem slightly to look like the following? (As always, give the problem a shot before reading on…):

The board of a large oil company is tasked with selecting a committee of three people to head a certain project for the following year. It has a list of ten applicants to choose from, three of whom are women and the remainder of whom are men. How many potential committees are possible if the committee must contain at least one woman?

A) 60
B) 75
C) 85
D) 90
E) 95

In this case, there’s a very important SIGNAL. The language “at least one” is a huge giveaway. This means there could be 1 woman, 2 women, or 3 women which means we would have to examine three separate cases. That’s a lot of busy work. 

But as we discussed in the previous post, why not instead look at what we don’t want and subtract it from the total? In this case, that would be the case of 0 women. Then, we could subtract that from the total number of combinations without restrictions. This would leave behind the cases we do want (i.e. all the cases involving at least one woman). 

We already discussed what happens without restrictions: There are 10 people to choose from, and we’re selecting a subgroup of 3 people, leading to 10C3  or 120 combinations possible. 

But how do we consider the combinations we don’t want? Well, we want to eliminate every combination that involves 0 women. In other words, we want to eliminate every possible committee of three people that involves all men. So how do we find that?

Well, there are seven men to choose from, and since we are choosing a subgroup of 3, we can simply use 7C3 to find the number of committees involving all men:

                       7!
7C3 =       ————-
                 3! (7-3!)

 

  7!
———
3! (4!)

 

7*6*5
———
    3!

= 7*5 = 35 Combinations involving all men

So, out of the 120 committees available, 35 of them involve all men. That means 120-35 = 85 involve at least one woman. The correct answer is C. 

Next time, we’ll return to probability and talk about how the principle of subtracting out elements that we don’t want can aid us on certain questions. Then we’ll dovetail the two and talk about how probability and combinatorics can show up simultaneously on certain questions.

Permutations and Combinations Intro
A Continuation of Permutation Math
An Intro To Combination Math
Permutations With Repeat Elements
Permutations With Restrictions
Combinations with Restrictions
Independent vs Dependent Probability
GMAT Probability Math – The Undesired Approach
GMAT Probability Meets Combinatorics: One Problem, Two Approaches

Read more
Permutations with Restrictions GMAT Article
Posted on
02
Mar 2021

Permutations with Restrictions

By: Rich Zwelling, Apex GMAT Instructor
Date: 2nd March, 2021

So far, we’ve covered the basics of GMAT combinatorics, the difference between permutations and combinations, some basic permutation and combination math, and permutations with repeat elements. Now, we’ll see what happens when permutation problems involve conceptual restrictions that can obscure how to approach the math.

To illustrate this directly, let’s take a look at the following Official Guide problem:

The letters D, G, I, I , and T can be used to form 5-letter strings as DIGIT or DGIIT. Using these letters, how many 5-letter strings can be formed in which the two occurrences of the letter I are separated by at least one other letter?

A) 12
B) 18
C) 24
D) 36
E) 48

Did you catch the restriction? Up until the end, this is a standard permutation with repeats combinatorics problem, since there are five letters and two repeats of the letter ‘I’. However, we’re suddenly told that the two I’s must be separated by at least one other letter. Put differently, they are not allowed to be adjacent.

So how do we handle this? Well, in many cases, it’s helpful to set aside what we want and instead consider what we don’t want. It seems counterintuitive at first, but if we consider the number of ways in which the two I’s can appear together (i.e. what is not allowed) and then subtract that number from the total number of permutations without any restrictions, wouldn’t we then be left with the number of ways in which the two I’s would not appear together (i.e. what is allowed)? 

Let’s demonstrate: 

In this case, we’ll pretend this problem has no restrictions. In the word “DIGIT,” there are five letters and two I’s. Using the principle discussed in our Permutations with Restrictions post, this would produce 5! / 2! = 60 permutations. 

However, we now want to subtract out the permutations that involve the two I’s side by side, since this condition is prohibited by the problem. This is where things become less about math and more about logic and conceptual understanding. Situationally, how would I outline every possible way the two I’s could be adjacent? Well, if I imagine the two I’s grouped together as one unit, there are four possible ways for this to happen:

II DGT

D II GT

DG II T

DGT II

For each one of these four situations, however, the three remaining letters can be arranged in 3*2*1 = 6 ways. 

That produces a total of 6*4 = 24 permutations in which the two I’s appear side by side.

Subtract that from the original 60, and we have: 60 – 24 = 36. The correct answer is D

As you can see, this is not about a formula or rote memorization but instead about logic and analytical skills. This is why tougher combinatorics questions are more likely to involve restrictions.

Here’s another Official Guide example. As always, give it a shot before reading on:

Of the 3-digit integers greater than 700, how many have 2 digits that are equal to each other and the remaining digit different from the other 2 ?

(A) 90
(B) 82
(C) 80
(D) 45
(E) 36

Explanation

This is a classic example of a problem that will tie you up in knots if you try to brute force it. You could try writing up examples that fit the description, such as 717, 882, 939, or 772, trying to find some kind of pattern based on what does work. But as with the previous problem, what if we examine conceptually what doesn’t work?

This will be very akin to how we handle some GMAT probability questions. The situation desired is 2 digits equal and 1 different. What other situations are there (i.e. the ones not desired)?  Well, if you take a little time to think about it, there are only two other possibilities: 

  1. The digits are all the same
  2. The digits are all different

If we can figure out the total number of permutations without restrictions and subtract out the number of permutations in the two situations just listed, we will have our answer. 

First, let’s get the total number of permutations without restrictions. In this case, that’s just all the numbers from 701 up to 999. (Be careful of the language. Since it says “greater than 700”, we will not include 700.)

To get the total number of terms, we must subtract the two numbers then add one to account for the end point. So there are (999-701)+1 = 299 numbers in total without restrictions.

(Another way to see this is that the range between 701 and 999 is the same as the range between 001 and 299, since we simply subtracted 700 from each number, keeping the range identical. It’s much easier to see that there are 299 numbers in the latter case.)

Now for the restrictions. How many of these permutations involve all the digits being the same? Well, this is straightforward enough to brute force: there are only 3 cases, namely 777, 888, and 999. 

How about all the digits being different? Here’s where we have to use our blank (or slot) method for each digit:

___ ___ ___

How many choices do we have for the first digit? The only choices we have are 7, 8, and 9. That’s three choices:

_3_  ___ ___

Once that first digit is in place, how many choices do we have left for the second slot? Well, there are 10 digits, but we have to remove the one already used in the first slot from consideration, as every digit must be different. That means we have nine left:

_3_  _9_  ___

Using the same logic, that leaves us eight for the final slot:

_3_  _9_  _8_

Multiplying them together, we have 3*9*8 = 216 permutations in which the digits are different.

So there are 216+3 = 219 restrictions, or permutations that we do not want. We can now subtract that from the total of 299 total permutations without restrictions to get our final answer of 299-219 = 80. The correct answer is C.

Next time, we’ll take a look at a few examples of combinatorics problems involving COMBINATIONS with restrictions.

Permutations and Combinations Intro
A Continuation of Permutation Math
An Intro To Combination Math
Permutations With Repeat Elements
Permutations With Restrictions
Combinations with Restrictions
Independent vs Dependent Probability
GMAT Probability Math – The Undesired Approach
GMAT Probability Meets Combinatorics: One Problem, Two Approaches

Read more
What happens when Permutations have repeat elements?
Posted on
25
Feb 2021

What happens when Permutations have repeat elements?

By: Rich Zwelling, Apex GMAT Instructor
Date: 25th February, 2021

Permutations With Repeat Elements

As promised in the last post, today we’ll discuss what happens when we have a PERMUTATIONS situation with repeat elements. What does this mean exactly? Well, let’s return to the basic example in our intro post on GMAT combinatorics:

If we have five distinct paintings, and we want to know how many arrangements can be created from those five, we simply use the factorial to find the answer (i.e. 5! = 5*4*3*2*1 = 120). Let’s say those paintings were labeled A, B, C, D, and E. 

Now, each re-arrangement of those five is a different PERMUTATION, because the order is different:

ABCDE
EBADC
CADBE


etc

Remember, there are 120 permutations because if we use the blank (or slot) method, we would have five choices for the first blank, and once that painting is in place, there would be four left for the second blank, etc…

_5_  _4_  _3_  _2_  _1_ 

…and we would multiply these results to get 5! or 120.

However, what if, say we suddenly changed the situation such that some of the paintings were identical? Let’s replace painting C with another B and E with another D:

ABBDD

Suddenly, the number of permutations decreases, because some paintings are no longer distinct. And believe it or not, there’s a formulaic way to handle the exact number of permutations. All you have to do is take the original factorial, and divide it by the factorials of each repeat. In this case, we have 5! for our original five elements, and we now must divide by 2! for the two B’s and another 2! for the two D’s:

  5!
——
2! 2!     

= 5*4*3*2*1
   ————-
  (2*1)(2*1)

= 5*2*3
= 30 permutations

As another example, try to figure out how many permutations you can make out of the letters in the word BOOKKEEPER? Give it a shot before reading the next paragraph.

In the case of BOOKKEEPER, there are 10 letters total, so we start with a base of 10! 

We then have two O’s, two K’s and three E’s for repeats, so our math will look like this:

   10!
———
2! 2! 3! 

Definitely don’t calculate this, though, as GMAT math stays simple and likes to come clean. Remember, we’ll have to divide out the repeats. You are extremely unlikely to have to do this calculation for a GMAT problem, however, since it relies heavily on busy-work mechanics. The correct answer choice would thus look like the term above. 

Let’s now take a look at an Official Guide question in which this principle has practical use. I’ll leave it to you to discover how. As usual, give the problem a shot before reading on:

A couple decides to have 4 children. If they succeed in having 4 children and each child is equally likely to be a boy or a girl, what is the probability that they will have exactly 2 girls and 2 boys?

(A) 3/8
(B) 1/4
(C) 3/16
(D) 1/8
(E) 1/16

Quick Probability Review

Remember from our post of GMAT Probability that, no matter how complicated the problem, probability always boils down to the basic concept of:

    Desired Outcomes
———————————–
Total Possible Outcomes

In this case, each child has two equally likely outcomes: boy and girl. And since there are four children, we can use are blank method to realize that we’ll be multiplying two 4 times:

_2_  _2_  _2_  _2_   =  16 total possible outcomes (denominator)

This may give you the premature notion that C or E must be correct, simply because you see a 16 in the denominator, but remember, fractions can reduce! We could have 4 in the numerator, giving us a fraction of 4/16, which would reduce to 1/4. And every denominator in the answer choices contains a factor of 16, so we can’t eliminate any answers based on this. 

Now, for the Desired Outcomes component, we must figure out how many outcomes consist of exactly two boys and two girls. The trick here is to recognize that it could be in any order. You could have the two girls followed by the two boys, vice versa, or have them interspersed. Now, you could brute-force this and simply try writing out every possibility. However, you must be accurate, and there’s a chance you’ll forget some examples. 

What if we instead write out an example as GGBB for two girls and two boys? Does this look familiar? Well, this should recall PERMUATIONS, as we are looking for every possible ordering in which the couple could have two girls and two boys. And yes, we have two G’s and two B’s as repeats. Here’s the perfect opportunity to put our principle into play:

We have four children, so we use 4! for our numerator, then we divide by 2! twice for each repeat:

  4!
——
2! 2! 

This math is much simpler, as the numerator is 24, while the denominator is 4. (Remember, memorize those factorials up to 6!)

This yields 6 desired outcomes of two boys and two girls. 

With 6 desired outcomes of 16 total possible outcomes, our final probability fraction is 6/16, which reduces to 3/8. The correct answer is A.

Next time, we’ll look into combinatorics problems that involve restrictions, which can present interesting conceptual challenges. 

Permutations and Combinations Intro
A Continuation of Permutation Math
An Intro To Combination Math
Permutations With Repeat Elements
Permutations With Restrictions
Combinations with Restrictions
Independent vs Dependent Probability
GMAT Probability Math – The Undesired Approach
GMAT Probability Meets Combinatorics: One Problem, Two Approaches

Read more
An Intro to Combination Math GMAT Article
Posted on
23
Feb 2021

An Intro to Combination Math

By: Rich Zwelling, Apex GMAT Instructor
Date: 23rd February, 2021

Last time, we looked at the following GMAT combinatorics practice problem, which gives itself away as a PERMUTATION problem because it’s concerned with “orderings,” and thus we care about the order in which items appear:

At a cheese tasting, a chef is to present some of his best creations to the event’s head judge. Due to the event’s very bizarre restrictions, he must present exactly three or four cheeses. He has brought his best cheddar, brie, gouda, roquefort, gruyere, and camembert. How many potential orderings of cheeses can the chef create to present to the judge?

A) 120
B) 240
C) 360
D) 480
E) 600

(Review the previous post if you’d like an explanation of the answer.)

Now, let’s see how a slight frame change switches this to a COMBINATION problem:

At a farmers market, a chef is to sell some of his best cheeses. Due to the market’s very bizarre restrictions, he can sell exactly two or three cheeses. He has brought his best cheddar, brie, gouda, roquefort, gruyere, and camembert. How many potential groupings of cheeses can he create for display to customers? 

A) 6
B) 15
C)
20
D) 35
E) 120

Did you catch why this is a COMBINATION problem instead of a PERMUTATION problem? The problem asked about “groupings.” This implies that we care only about the items involved, not the sequence in which they appear. Cheddar followed by brie followed by gouda is not considered distinct from brie followed by gouda followed by cheddar, because the same three cheeses are involved, thus producing the same grouping

So how does the math work? Well, it turns out there’s a quick combinatorics formula you can use, and it looks like this: 

combinations problem

Let’s demystify it. The left side is simply notational, with the ‘C’ standing for “combination.” The ‘n’ and the ‘k’ indicate larger and smaller groups, respectively. So if I have a group of 10 paintings, and I want to know how many groups of 4 I can create, that would mean n=10 and k=4. Notationally, that would look like this:

combinatorics and permutations on the GMAT, combination math on the gmat

Now remember, the exclamation point indicates a factorial. As a simple example, 4! = 4*3*2*1. You simply multiply every positive integer from the one given with the factorial down to one. 

So, how does this work for our problem? Let’s take a look:

At a farmers market, a chef is to sell some of his best cheeses. Due to the market’s very bizarre restrictions, he can sell exactly two or three cheeses. He has brought his best cheddar, brie, gouda, roquefort, gruyere, and camembert. How many potential groupings of cheeses can he create for display to customers? 

A) 6
B) 15
C)
20
D) 35
E) 120

The process of considering the two cases independently will remain the same. It cannot be both two and three cheeses. So let’s examine the two-cheese case first. There are six cheese to choose from, and we are choosing a subgroup of two. That means n=6 and k=2:

combinations and permutation on the gmat, combination math on the gmat

Now, let’s actually dig in and do the math:

combinatorics and permutations on the GMAT, combination math on the gmat

combinatorics and permutations on the GMAT, combination math on the gmat

From here, you’ll notice that 4*3*2*1 cancels from top and bottom, leaving you with 6*5 = 30 in the numerator and 2*1 in the denominator:

combinatorics and permutations on the GMAT, combination math on the gmat That leaves us with:

6C2 = 15 combinations of two cheeses

Now, how about the three-cheese case? Similarly, there are six cheeses to choose from, but now we are choosing a subgroup of three. That means n=6 and k=3:

solving a combinatorics problem

From here, you’ll notice that the 3*2*1 in the bottom cancels with the 6 in the top, leaving you with 5*4 = 20 in the numerator:

combination problem on the gmat answer

That leaves us with:

6C3 = 20 combinations of three cheeses

With 15 cases in the first situation and 20 in the second, the total is 35 cases, and our final answer is D. 

Next time, we’ll talk about what happens when we have permutations with repeat elements.

In the meantime, as an exercise, scroll back up and return to the 10-painting problem I presented earlier and see if you can find the answer. Bonus question: redo the problem with a subgroup of 6 paintings instead of 4 paintings. Try to anticipate: do you imagine we’ll have more combinations in this new case or fewer?

Permutations and Combinations Intro
A Continuation of Permutation Math
An Intro To Combination Math
Permutations With Repeat Elements
Permutations With Restrictions
Combinations with Restrictions
Independent vs Dependent Probability
GMAT Probability Math – The Undesired Approach
GMAT Probability Meets Combinatorics: One Problem, Two Approaches

Read more
A continuation of permutation math on the GMAT
Posted on
18
Feb 2021

A Continuation of Permutation Math

By: Rich Zwelling, Apex GMAT Instructor
Date: 16th February, 2021

Review of example from last post

Last time, when we started our discussion of GMAT Combinatorics, we gave a brief example of GMAT permutations in which we had five paintings and asked how many arrangements could be made on a wall with those paintings. As it turns out, no complicated combinatorics formula is necessary. You can create an easy graph with dashes and list five options for the first slot, leaving four for the second slot, and so on:

_5_  _4_ _3_ _2_ _1_

Then multiply 5*4*3*2*1 to get 120 arrangements of the five paintings. Remember you could see this notationally as 5!, or 5 factorial. (It’s helpful to memorize factorials up to 6!)

More permutation math

But there could be fewer slots then items. Take the following combinatorics practice problem:

At a cheese tasting, a chef is to present some of his best creations to the event’s head judge. Due to the event’s very bizarre restrictions, he must present exactly three or four cheeses. He has brought his best cheddar, brie, gouda, roquefort, gruyere, and camembert. How many potential orderings of cheeses can the chef create to present to the judge?

A) 120
B) 240
C) 360
D) 480
E) 600

First, as a review, how do we know this is a PERMUTATION and not a COMBINATION? Because order matters. In the previous problem, the word “arrangements” gave away that we care about the order in which items appear. In this problem, we’re told that we’re interested in the “orderings” of cheeses. Cheddar followed by gouda would be considered distinct from gouda followed by cheddar. (Look for signal words like “arrangements” or “orderings” to indicate a PERMUTATION problem.)

In this case, we must consider the options of three or four cheeses separately, as they are independent (i.e. they cannot both happen). But for each case, the process is actually no different from what we discussed last time. We can simply consider each case separately and create dashes (slots) for each option. In the first case (three cheeses), there are six options for the first slot, five for the second, and four for the third:

_6_  _5_  _4_

We multiply those together to give us 6*5*4 = 120 possible ways to present three cheeses. We do likewise for the four-cheese case:

_6_  _5_  _4_  _3_

We multiply those together to give us 6*5*4*3 = 360 possible ways to present four cheeses.

Since these two situations (three cheeses and four cheeses) are independent, we simply add them up to get a final answer of 120+360 = 480 possible orderings of cheeses, and the correct answer is D. 

You might have also noticed that there’s a sneaky arithmetic shortcut. You’ll notice that you have to add 6*5*4 + 6*5*4*3. Instead of multiplying each case separately, you can factor out 6*5*4 from the sum, as follows:

6*5*4 + 6*5*4*3

= 6*5*4 ( 1 + 3)

= 6*5*4*4

= 30*16 OR 20*24

= 480

Develop the habit of looking for quick, efficient ways of doing basic arithmetic to bank time. It will pay off when you have to do more difficult questions in the latter part of the test. 

Now that we have been through GMAT permutations, next time, I’ll give this problem a little twist and show you how to make it a COMBINATION problem. Until then…

Permutations and Combinations Intro
A Continuation of Permutation Math
An Intro To Combination Math
Permutations With Repeat Elements
Permutations With Restrictions
Combinations with Restrictions
Independent vs Dependent Probability
GMAT Probability Math – The Undesired Approach
GMAT Probability Meets Combinatorics: One Problem, Two Approaches

Read more
Featured Video Play Icon
Posted on
17
Feb 2021

Data Sufficiency: Area of a Triangle Problem

Hey guys! Today we’re checking out a geometry Data Sufficiency problem asking for the area of a triangle, and while the ask might seem straightforward, it’s very easy to get caught up in the introduced information on this problem. And this is a great example of a way that the GMAT can really dictate your thought processes via suggestion if you’re not really really clear on what it is you’re looking for on DS. So here we’re looking for area but area specifically is a discrete measurement; that is we’re going to need some sort of number to anchor this down: whether it’s the length of sides, or the area of a smaller piece, we need some value!

Begin with Statement #2

Jumping into the introduced information, if we look at number 2, because it seems simpler, we have x = 45 degrees. Now you might be jumping in and saying, well, if x = 45 and we got the 90 degree then we have 45, STOP. Because if you’re doing that you missed what I just said. We need a discrete anchor point. The number of degrees is both relative in the sense that the triangle could be really huge or really small, and doesn’t give us what we need. So immediately we want to say: number 2 is insufficient. Rather than dive in deeply and try and figure out how we can use it, let’s begin just by recognizing its insufficiency. Know that we can go deeper if we need to but not get ourselves worked up and not invest the time until it’s appropriate, until number 1 isn’t sufficient and we need to look at them together.

Consider Statement #1

Number 1 gives us this product BD x AC = 20. Well here, we’re given a discrete value, which is a step in the right direction. Now, what do we need for area? You might say we need a base and a height but that’s not entirely accurate. Our equation, area is 1/2 x base x height, means that we don’t need to know the base and the height individually but rather their product. The key to this problem is noticing in number 1 that they give us this B x H product of 20, which means if we want to plug it into our equation, 1/2 x 20 is 10. Area is 10. Number 1 alone is sufficient. Answer choice A.

Don’t Get Caught Up With “X”

If we don’t recognize this then we get caught up with taking a look at x and what that means and trying to slice and dice this, which is complicated to say the least. And I want you to observe that if we get ourselves worked up about x, then immediately when we look at this BD x AC product, our minds are already in the framework of how to incorporate these two together. Whereas, if we dismiss the x is insufficient and look at this solo, the BD times AC, then we’re much more likely to strike upon that identity. Ideally though, of course, before we jump into the introduced information, we want to say, well, the area of a triangle is 1/2 x base x height. So, if I have not B and H individually, although that will be useful, B x H is enough. And then it’s a question of just saying, well, one’s got what we need – check. One is sufficient. Two doesn’t have what we need – isn’t sufficient, and we’re there. So,

I hope this helped. Look for links to other geometry and fun DS problems below and I’ll see you guys soon. Read this article about Data sufficiency problems and triangles next to get more familiar with this type of GMAT question.

Read more
Triangle With Other Shapes on the GMAT
Posted on
16
Feb 2021

Triangles With Other Shapes

By: Rich Zwelling, Apex GMAT Instructor
Date: 16th February, 2021

As discussed before, now that we’ve talked about the basic triangles, we can start looking at how the GMAT can make problems difficult by embedding triangles in other figures, or vice versa. 

Here are just a few examples, which include triangles within and outside of squares, rectangles, and circles:

triangles in other shapes GMAT article

Today, we’ll talk about some crucial connections that are often made between triangles and other figures, starting with the 45-45-90 triangle, also known as the isosceles right triangle.

You’ve probably seen a rectangle split in two along one of its diagonals to produce two right triangles:

triangles in other shapes gmat article gmat problem

But one of the oft-overlooked basic geometric truths is that when that rectangle is a square (and yes, remember a square is a type of rectangle), the diagonal splits the square into two isosceles right triangles. This makes sense when you think about it, because the diagonal bisects two 90-degree angles to give you two 45-degree angles:

triangles in other shapes gmat article, 45 45 90 degree angle

(For clarification, the diagonal of a rectangle is a bisector when the rectangle is a square, but it is not a bisector in any other case.)

Another very common combination of shapes in more difficult GMAT Geometry problems is triangles with circles. This can manifest itself in three common ways:

  1. Triangles created using the central angle of a circle

triangle in a circle, gmat geometry article

In this case, notice that two of the sides of the triangle are radii (remember, a radius is any line segment from the center of the circle to its circumference). What does that guarantee about the triangle?

Since two side are of equal length, the triangle is automatically isosceles. Remember that the two angles opposite those two sides are also of equal measure. So any triangle with the center of the circle as one vertex and points along the circumference as the other two vertices will automatically be an isosceles triangle.

2. Inscribed triangles

triangle inscribed in circle, gmat problem

An inscribed triangle is any triangle with a circle’s diameter as one of its sides and a vertex along the circumference. And a key thing to note: an inscribed triangle will ALWAYS be a right triangle. So even if you don’t see the right angle marked, you can rest assured the inscribed angle at that third vertex is 90 degrees.

3. Squares and rectangles inscribed in circles

rectangle in circle, gmat geometry

What’s important to note here is that the diagonal of the rectangle (or square) is equivalent to the diameter of the circle.

Now that we’ve seen a few common relationships between triangles and other figures, let’s take a look at an example Official Guide problem:

A small, rectangular park has a perimeter of 560 feet and a diagonal measurement of 200 feet. What is its area, in square feet?

A) 19,200
B) 19,600
C) 20,000
D) 20,400
E) 20,800

Explanation

The diagonal splits the rectangular park into two similar triangles:

triangle in other shapes gmat problem

Use SIGNALS to avoid algebra

It can be tempting to then jump straight into algebra. The formulas for perimeter and diagonal are P = 2L + 2W an D2 = L2 + W2, respectively, where L and W are the length and width of the rectangle. The second formula, you’ll notice, arises out of the Pythagorean Theorem, since we now have two right triangles. We are trying to find area, which is LW, so we could set out on a cumbersome algebraic journey.

However, let’s try to use some SIGNALS the problem gives us and our knowledge of how the GMAT operates to see if we can short-circuit this problem.

We know the GMAT is fond of both clean numerical solutions and common Pythagorean triples. The large numbers of 200 for the diagonal and 560 for the perimeter don’t change that we now have a very specific rectangle (and pair of triangles). Thus, we should suspect that one of our basic Pythagorean triples (3-4-5, 5-12-13, 7-24-25) is involved.

Could it be that our diagonal of 200 is the hypotenuse of a 3-4-5 triangle multiple? If so, the 200 would correspond to the 5, and the multiplying factor would be 40. That would also mean that the legs would be 3*40 and 4*40, or 120 and 160.

Does this check out? Well, we’re already told the perimeter is 560. Adding 160 and 120 gives us 280, which is one length and one width, or half the perimeter of the rectangle. We can then just double the 280 to get 560 and confirm that we do indeed have the correct numbers. The length and width of the park must be 120 and 160. No algebra necessary.

Now, to get the area, we just multiply 120 by 160 to get 19,200 and the final answer of A.

Check out the following links for our other articles on triangles and their properties:

A Short Meditation on Triangles
The 30-60-90 Right Triangle
The 45-45-90 Right Triangle
The Area of an Equilateral Triangle
Isosceles Triangles and Data Sufficiency
Similar Triangles
3-4-5 Right Triangle
5-12-13 and 7-24-25 Right Triangles

Read more
Combinatorics: Permutations and Combinations Intro On the GMAT
Posted on
11
Feb 2021

Combinatorics: Permutations and Combinations Intro

By: Rich Zwelling, Apex GMAT Instructor
Date: 11th February, 2021

GMAT Combinatorics. It’s a phrase that’s stricken fear in the hearts of many of my students. And it makes sense, because so few of us are taught anything about it growing up. But the good news is that, despite the scary title, what you need to know for GMAT combinatorics problems is actually not terribly complex.

To start, let’s look at one of the most commonly asked questions related to GMAT combinatorics, namely the difference between combinatorics and permutations

Does Order Matter?

It’s important to understand conceptually what makes permutations and combinations differ from one another. Quite simply, it’s whether we care about the order of the elements involved. Let’s look at these concrete examples to make things a little clearer:

Permutations example

Suppose we have five paintings to hang on a wall, and we want to know in how many different ways we can arrange the paintings. It’s the word “arrange” that often gives away that we care about the order in which the paintings appear. Let’s call the paintings A, B, C, D, and E:

ABCDE
ACDEB
BDCEA

Each of the above three is considered distinct in this problem, because the order, and thus the arrangement, changes. This is what defines this situation as a PERMUTATION problem. 

Mathematically, how would we answer this question? Well, quite simply, we would consider the number of options we have for each “slot” on the wall. We have five options at the start for the first slot:

_5_  ___ ___ ___ ___

After that painting is in place, there are four remaining that are available for the next slot:

_5_  _4_ ___ ___ ___

From there, the pattern continues until all slots are filled:

_5_  _4_ _3_ _2_ _1_

The final step is to simply multiply these numbers to get 5*4*3*2*1 = 120 arrangements of the five paintings. The quantity 5*4*3*2*1 is also often represented by the exclamation point notation 5!, or 5 factorial. (It’s helpful to memorize factorials up to 6!)

Combinations example

So, what about COMBINATIONS? Obviously if we care about order for permutations, that implies we do NOT care about order for combinations. But what does such a situation look like?

Suppose there’s a local food competition, and I’m told that a group of judges will taste 50 dishes at the competition. A first, a second, and a third prize will be given to the top three dishes, which will then have the honor of competing at the state competition in a few months. I want to know how many possible groups of three dishes out of the original 50 could potentially be selected by the judges to move on to the state competition.

The math here is a little more complicated without a combinatorics formula, but we’re just going to focus on the conceptual element for the moment. How do we know this is a COMBINATION situation instead of a permutation question? 

It’s a little tricky, because at first glance, you might consider the first, second, and third prizes and believe that order matters. Suppose that Dish A wins first prize, Dish B wins second prize, and Dish C wins third prize. Call that ABC. Isn’t that a distinct situation from BAC? Or CAB? 

Well, that’s where you have to pay very close attention to exactly what the question asks. If we were asking about distinct arrangements of prize winnings, then yes, this would be a permutation question, and we would have to consider ABC apart from BAC apart from CAB, etc. 

However, what does the question ask about specifically? It asks about which dishes advance to the state competition? Also notice that the question specifically uses the word “group,” which is often a huge signal for combinations questions. This implies that the total is more important than the individual parts. If we take ABC and switch it to BAC or BCA or ACB, do we end up with a different group of three dishes that advances to the state competition? No. It’s the same COMBINATION of dishes. 

Quantitative connection

It’s interesting to note that there will always be fewer combinations than permutations, given a common set of elements. Why? Let’s use the above simple scenario of three elements as an illustration and write out all the possible permutations of ABC. It’s straightforward enough to brute-force this by including two each starting with A, two each starting with B, etc:

ABC
ACB
BAC
BCA
CAB
CBA

But you could also see that there are 3*2*1 = 3! = 6 permutations by using the same method we used for the painting example above. Now, how many combinations does this constitute? Notice they all consist of the same group of three letters, and thus this is actually just one combination. We had to divide the original 6 permutations by 3! to get the correct number of permutations.

Next time, we’ll continue our discussion of permutation math and begin a discussion of the mechanics of combination math. 

Permutations and Combinations Intro
A Continuation of Permutation Math
An Intro To Combination Math
Permutations With Repeat Elements
Permutations With Restrictions
Combinations with Restrictions
Independent vs Dependent Probability
GMAT Probability Math – The Undesired Approach
GMAT Probability Meets Combinatorics: One Problem, Two Approaches

Read more
Triangle Inequality Rule on the GMAT
Posted on
09
Feb 2021

Triangle Inequality Rule

By: Rich Zwelling, Apex GMAT Instructor
Date: 9th February, 2021

One of the less-common but still need-to-know rules tested on the GMAT is the “triangle inequality” rule, which allows you to draw conclusions about the length of the third side of a triangle given information about the lengths of the other two sides.

Often times, this rule is presented in two parts, but I find it is easiest to condense it into one, simple part that concerns a sum and a difference. Here’s what I mean, and we’ll use a SCENARIO:

Suppose we have a triangle that has two sides of length 3 and 5:

triangles inequalities 1

What can we say about the length of the third side? Of course, we can’t nail down a single definitive value for that length, but we can actually put a limit on its range. That range is simply the difference and the sum of the lengths of the other two sides, non-inclusive.

So, in this case, since the difference between the lengths of the other two sides is 2, and their sum is 8, we can say for sure that the third side of this triangle must have a length between 2 and 8, non-inclusive. [Algebraically, this reads as (5-3) < x < (5+3) OR 2 < x < 8.]

If you’d like to see that put into words:

**The length of any side of a triangle must be shorter than the sum of the other two side lengths and longer than the difference of the other two side lengths.**

It’s important to note that this works for any triangle. But why did we say non-inclusive? Well, let’s look at what would happen if we included the 8 in the above example. Imagine a “triangle” with lengths 3, 5, and 8. Can you see the problem? (Think about it before reading the next paragraph.)

Imagine a twig of length 3 inches and another of length 5 inches. How would you form a geometric figure of length 8 inches? You’d simply join the two twigs in a straight line to form a longer, single twig of 8 inches. It would be impossible to form a triangle with a side of 8 inches with the original two twigs.

triangle inequalities 2

 

If you wanted to form a triangle with the twigs of 3 and 5, you’d have to “break” the longer twig of 8 inches and bend the two twigs at an angle for an opportunity to have a third side, guaranteed to be shorter than 8 inches:

triangle inequalities 3

The same logic would hold for the other end of the range (we couldn’t have a triangle of 3, 5, and 2, as the only way to form a length of 5 from lengths of 2 and 3 would be to form a longer line segment of 5.)

Now that we’ve covered the basics, let’s dive into a few problems, starting with this Official Guide problem:

If k is an integer and 2 < k < 7, for how many different values of k is there a triangle with sides of lengths 2, 7, and k?
(A) one
(B) two
(C) three
(D) four
(E) five

Strategy: Eliminate Answers

As usual with the GMAT, it’s one thing to know the rule, but it’s another when you’re presented with a carefully worded question that tests your ability to pay close attention to detail. First, we are told that two of the lengths of the triangle are 2 and 7. What does that mean for the third side, given the triangle inequality rule? We know the third side must have a length between 5 (the difference between the two sides) and 9 (the sum of the two sides).

Here, you can actually use the answer choices to your advantage, at least to eliminate some answers. Notice that k is specified as an integer. How many integers do we know now are possible? Well, if k must be between 5 and 9 (and remember, it’s non-inclusive), the only options possibly available to us are 6, 7, and 8. That means a maximum of three possible values of k, thus eliminating answers D and E.

Since the GMAT is a time-intensive test, you might have to end up guessing now and then, so if you can strategically eliminate answers, it increases your chances of guessing correctly.

Now for this problem, there’s another condition given, namely that 2 < k < 7. We already determined that k must be 6, 7, or 8. However, of those numbers, only 6 fits in the given range 2 < k < 7. This means that 6 is the only legal value that fits for k. The correct answer is A.

Note:

It’s important to emphasize that the eliminate answers strategy is not a mandate. We’re simply presenting it as an option that works here because it is useful on many GMAT problems and should be explored and practiced as often as possible.

Check out the following links for our other articles on triangles and their properties:

A Short Meditation on Triangles
The 30-60-90 Right Triangle
The 45-45-90 Right Triangle
The Area of an Equilateral Triangle
Triangles with Other Shapes
Isosceles Triangles and Data Sufficiency
Similar Triangles
3-4-5 Right Triangle
5-12-13 and 7-24-25 Right Triangles

Read more
GMAT 3 Month Study Plan
Posted on
04
Feb 2021

GMAT 3-Month Study Plan

By: Apex GMAT
Contributor: Uerda Muca
Date: 4th February, 2021

When should you start GMAT preparation? 

One of the most crucial decisions to make before you start preparing for the GMAT test is to decide when is the latest and/or earliest time to start preparing in order to do well on the exam. Giving an answer to this question is not as straightforward and easy as it might sound. There are various factors that need to be taken into account, such as your current skill set in English and Math, your target GMAT score, the amount of time per week you are planning to allot to studying, etc. However, with a sensible preparation strategy, one should be able to reach their target score on the GMAT in a 3 month timeframe. 

University requirements

Most business schools consider the GMAT to be a crucial data point in the admissions process and your goal GMAT score depends on which universities you want to gain acceptance into. Every university has its own GMAT score requirement. So, begin your GMAT journey by researching the schools or programs that you are interested in applying to and note the average GMAT score for their recent admitted candidates. Following this, gather information regarding their application deadlines. This will give a better idea of when to schedule your exam and how to adjust your study plan accordingly. 

GMAT Study Plan
Week 1: GMAT Basics

Become familiar with the GMAT format and content. Prepare yourself for what you are about to encounter during the next 3 months and on the day of your GMAT exam. All you need to know about the GMAT, its structure, sections, timing, scoring, and more can be found Here

Take a diagnostics test. You haven’t studied at all for the GMAT? That’s totally fine, you can still take the test. As the name itself suggests, the point of this test is to diagnose, based on your Quantitative, Verbal, and Integrated Reasoning scores, your strengths and weaknesses. Something to keep in mind; You should take the exam under the same exact conditions as the actual GMAT exam. This is an excellent representation of how the GMAT exam is conducted. To take the GMAT practice exam click Here

Analyze your results. As you are in the process of reviewing the results of your diagnostics test, it would be helpful to ask yourself some questions to better understand the difficulties you encountered. When analyzing the solutions of some questions you got wrong or maybe you weren’t totally confident about, take note of any patterns. What section/s did you find most challenging? Which types of questions within each section were you struggling most with? Also, don’t forget to ask yourself questions about the “bigger picture” like: Were you able to finish every section? Did you feel anxious? How did you feel at the end of the test?

Week 2: Quant Section

Familiarize yourself with the GMAT quant section. Read about which types of quantitative questions and content that you are most likely to come across during your 3 months of preparation, mock tests, and the GMAT test.

Review GMAT Math. Before diving deeper into preparing for this section, take some time to brush up on some of the formulas, definitions, and topics of the Maths section. 

Learn the underlying concepts related to each topic (percents, ratios, exponents, statistics, etc). In this section, you will come across some specific wording that can be fundamental to finding the solution to the problems. In order to not get stuck during the exam and waste your precious time, learning about the most frequently used concepts is helpful.

Week 3: Verbal Section 

Make yourself acquainted with the GMAT verbal section. A great way to start working with the verbal section is to become familiar with the overall structure of this section. To learn more about this section, how it is scored, and some insights about its subsections click Here.

Learn how to tackle each type of question. There are three types of questions in the verbal section and their purpose is to test certain skills. This means that for each of them you have to use particular strategies. 

Tip. It’s more effective to concentrate on one area at a time. So, while preparing for this section, choose one subsection and stick with it for a couple of days.

Week 4: Monthly Progress Check 

Take a mock test. As the saying goes “Practice makes perfect.” The more you get yourself exposed to GMAT practice exams, the more likely you are to achieve your desired score.

Review your results. While looking at the answer explanations, pay attention to the solutions of the questions you got incorrectly.  

Practice the type of questions you are having difficulties with. Identify the questions where you are spending more time than you should. Read some articles that recommend tips, strategies, and tactics that can assist in solving them faster. 

Week 5: Quant Review

Practice and enhance your knowledge of data sufficiency questions. Now that you are familiar with this term it’s a good time to start reading some strategies on how to tackle these types of questions. After doing that, practicing what you just learned by solving problems focused particularly on these types of questions is extremely beneficial to your progress. 

Practice and enhance your knowledge of problem solving questions. These are other types of questions that you will need to do some research and then solve some problem sets on. 

Week 6: Verbal Review 

Practice and enhance your knowledge of Critical Reasoning questions. You can find articles about tips specifically about these types of questions and while practicing you be sure to make use of them. Another practical thing to do is read about articles related to common mistakes and how to avoid them. 

Practice and enhance your knowledge of Sentence Correction questions. Additionally, as was mentioned above, these types of questions concentrate on reviewing a few basic grammar concepts and skills.

Practice and enhance your knowledge of Reading Comprehension questions. Besides reading articles related to tips and common mistakes, reading Reading Comprehension-like writing is an excellent way to familiarize yourself with the style and content of Reading Comprehension passages.

Week 7: Integrated Reasoning Section

Become familiar with the GMAT Integrated Reasoning Section. Get informed about how long this section lasts, what is its total number of questions, and what types of questions you will encounter. Then you can move on to learn more about its purpose and what makes this section different from the others. 

Brush up on your graph reading skills. For the most part, this section depends on the same math, verbal, and critical reasoning skills that you need for the other sections of the GMAT. Keeping in mind that the inclusion of diverse graphs is what gives this section its uniqueness. You can spend some time getting comfortable with interpreting data from various sources.

Week 8: Monthly Progress Check 

Take mock tests. After studying for almost every section, taking some mock tests will assist in keeping track of your progress. 

Review your results. This time try to identify the topics you are still not comfortable with. Solely taking mock tests without analyzing the explanations to questions is not going to be much help. 

Practice the type of questions you are struggling with. After analyzing these practice tests and understanding the patterns of your weaknesses, working more on the questions you find challenging leads to score improvements.

Week 9: Integrated Reasoning Review

Practice and enhance your knowledge of all four types of questions. As you might have noticed a pattern already, reading about tips, tricks, common mistakes, strategies, tactics, etc. for each type of question and putting them into practice is what you can do when reviewing every section of the GMAT exam. 

Week 10: AWA Section 

Make yourself acquainted with the GMAT AWA section. This is the step that, as you have seen so far, applies to every section. You can’t anticipate doing well on a task without knowing what is expected from you. An introductory article regarding the AWA section can be read Here

Review sample AWA templates. This is something that might come in handy when you need to format your essays. With some modifications, these templates can be used on test day. 

Practice. Practice. Practice. Writing a couple of essays in a day will help you master your timing and get used to the structure you may use on your GMAT essay.

Week 11: Time and Stress Management 

Some other significant factors to consider while working on preparing for the GMAT test are time and stress management. A good start is reading a handful of blogs and articles that suggest many tips and strategies that can help you improve your time and stress management skills. If you want to learn more about how to master stress, how a private GMAT Tutoring can assist you with that, and more click Here.

Week 12: Review and Relax. 

During the last week don’t put a lot of pressure on yourself. Instead, try to take care of your mind and body as much as you can. One last brief review focused primarily on the sections or type of questions you struggled most with is going to be enough.  Finally, the most important tip, don’t forget to enjoy your GMAT preparation journey.

We at the Apex team hope that you find this GMAT study plan helpful. If you want to discuss your progress and possibly having some one on one preparation sessions with us, we would be happy to help, set up a complimentary consultation call with a GMAT instructor here

Read more