-
Target Test Prep 20% Off Flash Sale is on! Code: FLASH20
Redeem
Disguising – and Decoding – Quant Problems
How can the GMAT disguise a prime number (or any other) problem? Thats exactly what were going to discuss today! Were going to use the concept of prime to describe this, but the general process of disguising and studying how to decode problems is applicable to a great number of problems on the test. Pay close attention to the end of the article; you can use these concepts when studying a number of different GMAT content areas.
What is a prime number?
First, in order to recognize a disguise, you actually have to understand the fundamental concept at play. So lets talk about prime numbers.
The concept of prime, by definition, applies only to positive numbers. Also, by definition, all primes are integers. Were concerned, then, with the set of positive integers (and thats the only set well consider for the rest of the article).
Most people, when asked to define or describe the concept of prime, will say that a prime number is divisible by itself and 1. (What does divisible mean? One number is divisible by another when the result of that division is an integer. For example, 12 is divisible by 6 because 12 divided by 6 equals an integer.)
Interestingly, though, any positive integer is divisible by itself and 1. The number 1 is divisible by itself and 1. The number 2 is divisible by itself and 1. The number 9 is divisible by itself and 1. Yet only one of those numbers is actually a prime number. If ALL positive integers are divisible by themselves and one, then what is different about prime numbers?
Articulate your answer to yourself before you keep reading.
When considering positive integers, there are three categories: prime, non-prime (or composite), and the number 1. Although the number 1 is divisible by itself and 1, itself equals one. The number 1, then, has only one factor. A prime number is divisible by itself and 1, where itself is a different number than the number 1. In other words, a prime number has exactly two factors. A composite number is divisible by itself, 1, and at least one other number; a composite number, then, has more than two factors (itself, 1, and at least one number in between).
So a prime number has exactly two factors.
(Hmm. Whats a factor? A factor is a positive integer that divides evenly into an integer. For example, 6 is a factor of 12 because 12/6 = 2, and 2 is an integer. In fact, 1, 2, 3, 4, 6, and 12 are all factors of 12 because, when 12 is divided by each of those factors, the result is an integer.)
Okay, so a prime number has exactly two factors. Non-prime numbers have either one factor (the number 1) or more than two factors (composite numbers).
The number 1 is the only number that has exactly one factor. It is not prime. The numbers 2, 3, and 5 all have exactly two factors; they are all prime numbers. The numbers 4, 9, and 16 all have more than two factors; they are all composite numbers.
Okay, so a prime number has exactly two factors, itself and one, while a composite number has more than two factors: itself, one, and at least one other factor between itself and one. Thats the real distinction between prime and composite numbers (and these two categories include all positive integers with the exception of the number 1).
How will the GMAT disguise a prime number problem?
There are a number of ways that the GMAT can test our knowledge of some concept in general. One common theme on more difficult problems, though, is an attempt to disguise the fact that the problem is about (in this case) prime numbers. Often, the word prime will not even appear in the problem. Essentially, the test writers are testing whether you can decode the language to realize that the problem is really asking about prime (or composite) numbers.
For example, a data sufficiency problem might tell us about the positive integer x, which does not equal 1. Are there two integers, both of which are greater than 1, that can multiply to give us x?
What am I really asking you there? Can you think of a specific value for x that would allow you to answer yes to that question? And a specific value that would give a no answer instead?
Lets see. 2*2 = 4. Those are two integers (theyre not different but notice that my question didnt specify two distinct integers) and both are greater than 1. They multiple to equal 4. So, if positive integer x is 4, then yes: there are two numbers, both greater than 1, that multiply to give us 4. (These two integers that were multiplying are called factors of x. 2 is a factor of 4.)
On the other hand, 1*5 = 5. That doesnt work because both numbers are not greater than 1, so the answer to the question (for this specific example) is no. For the integer 5, the answer will always be no. Why? Because theres no way to express 5 as the product of two integers without using 1; there are no factors of 5 that are between 1 and 5.
Whats the difference between those two numbers? The first is composite and the second is prime. A composite number will always result in a yes answer for this question, because a composite number, by definition, has at least one factor between 1 and itself. A prime number, by contrast, will always result in a no answer for this question, because a prime number has exactly two factors, 1 and itself.
Back to my question: Are there two integers, both of which are greater than 1, that can multiply to give us x? Im really asking you whether x is prime or composite (or, because this is data sufficiency, whether you cant tell at all). In formulating my question, I incorporated the distinction between prime and composite numbers: I used the definition so that I could avoid giving you the term prime in the question.
Why is this broadly applicable to the GMAT?
This is one of the fundamental ways in which the test writers can make any question harder: ask you about a concept without using the actual name for that concept. Its not enough just to know the concept; you have to figure out that theyre referring to that concept in the first place.
Your task as a student is to figure out how the test writers can ask about various properties or principles without using the names of those properties or principles. The only way to do this is to give the definition instead, so study HOW that will look on a GMAT Problem. What is the definition, as precisely as possible? What are the different ways in which that could be worded in a question? Can you find two or three OG (Official Guide) questions that ask about the same fundamental principle using somewhat different wording?
Check out #39 from the Quant Review 2nd Edition and #153 from the Official Guide 11th Edition. (Do they look familiar in some way?) The structure of the two problems is almost identical, though the harder one also incorporates additional concepts. In addition, you could solve the easier one by testing real numbers, so you don't absolutely have to figure out the "prime" aspect in order to answer that one. For the harder one, though, you do actually have to recognize that the problem is testing the concept of prime. Here's the kicker: it's easier to figure out the "prime disguise" on the easier problem; then, all you have to do is recognize it on the harder problem. That ability to recognize the fundamental issue will then give you time to deal with all of the additional complexity in the harder problem.
Take-Aways
- Know the definition of prime, but also know the difference between prime and non-prime (or composite) numbers.
- Know how the test writers can ask about prime without using that specific word. Dont stop with prime! What other concepts can they ask about without using the specific word? What are the very precise definitions, and what are the different ways in which they might word a problem to reflect each precise definition?
- How will you recognize similar wording on future problems?
Recent Articles
Archive
- April 2024
- March 2024
- February 2024
- January 2024
- December 2023
- November 2023
- October 2023
- September 2023
- July 2023
- June 2023
- May 2023
- April 2023
- March 2023
- February 2023
- January 2023
- December 2022
- November 2022
- October 2022
- September 2022
- August 2022
- July 2022
- June 2022
- May 2022
- April 2022
- March 2022
- February 2022
- January 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- June 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- July 2020
- June 2020
- May 2020
- April 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009