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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

A Pierpont prime is any prime number p such that p = (2^k)(3^l) + 1 [#permalink]

Show Tags

25 Jan 2014, 06:36

13

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

95% (hard)

Question Stats:

31% (01:00) correct 69% (00:42) wrong based on 345 sessions

HideShow timer Statistics

A Pierpont prime is any prime number p such that \(p =(2^k)(3^l)+1\), where k and l are non-negative integers. If r is an integer, is r a Pierpont prime?

Concentration: General Management, Entrepreneurship

GPA: 3.54

WE: Project Management (Retail Banking)

Re: A Pierpont prime is any prime number p such that p = (2^k)(3^l) + 1 [#permalink]

Show Tags

25 Jan 2014, 06:55

4

This post received KUDOS

1

This post was BOOKMARKED

guerrero25 wrote:

A Pierpont prime is any prime number p such that p =(2^k)(3^l)+1 , where k and l are non-negative integers. If r is an integer, is r a Pierpont prime?

A) 1 < r < 5 B)0 < r < 4

I do not have OA with me right now .

Hi,

A) 1<r<5 Since r is an integer , then the possible values that can take r are : 2,3 and 4. r is a Pierpont prime if r = (2^k)(3^l)+1 r=2 --> r is a Pierpont prime since 2 is prime and 2 can be written as : 2 = (2^0)(3^0) + 1 r=3 --> r is a Pierpont prime since 3 is prime and 3 can be written as : 3 = (2^1)(3^0) + 1 r=4 --> r is NOT a Pierpont prime since 4 is not prime. Hence, This statement alone is Insufficient

B) 0<r<4 Since r is an integer, then the possible values that can take r are : 1,2 and 3 AS seen in Statement 1 , 2 and 3 are Pierpont prime but 1 is not prime , hence this statement is insufficent itself

A+B) Now, Statements combined, we should have : 1<r<4 that give r the only two possible values : 2 and 3 and both of them are Pierpont prime as seen before

Hence , the answer is Yes . Answer : C
_________________

KUDOS is the good manner to help the entire community.

"If you don't change your life, your life will change you"

Re: A Pierpont prime is any prime number p such that p = (2^k)(3^l) + 1 [#permalink]

Show Tags

09 Aug 2014, 23:53

Rock750 wrote:

guerrero25 wrote:

A Pierpont prime is any prime number p such that p =(2^k)(3^l)+1 , where k and l are non-negative integers. If r is an integer, is r a Pierpont prime?

A) 1 < r < 5 B)0 < r < 4

I do not have OA with me right now .

Hi,

A) 1<r<5 Since r is an integer , then the possible values that can take r are : 2,3 and 4. r is a Pierpont prime if r = (2^k)(3^l)+1 r=2 --> r is a Pierpont prime since 2 is prime and 2 can be written as : 2 = (2^0)(3^0) + 1 r=3 --> r is a Pierpont prime since 3 is prime and 3 can be written as : 3 = (2^1)(3^0) + 1 r=4 --> r is NOT a Pierpont prime since 4 is not prime. Hence, This statement alone is Insufficient

B) 0<r<4 Since r is an integer, then the possible values that can take r are : 1,2 and 3 AS seen in Statement 1 , 2 and 3 are Pierpont prime but 1 is not prime , hence this statement is insufficent itself

A+B) Now, Statements combined, we should have : 1<r<4 that give r the only two possible values : 2 and 3 and both of them are Pierpont prime as seen before

Hence , the answer is Yes . Answer : C

Hi,

Can anyone explain, how can we have 1 as a solution using statement 2, since 2^0 X 3^0 + 1 = 2, so we can never reach 1. So only options left are 2 & 3 so ans should be statement B.

Re: A Pierpont prime is any prime number p such that p = (2^k)(3^l) + 1 [#permalink]

Show Tags

14 Aug 2014, 11:32

PuneetSood wrote:

Rock750 wrote:

guerrero25 wrote:

A Pierpont prime is any prime number p such that p =(2^k)(3^l)+1 , where k and l are non-negative integers. If r is an integer, is r a Pierpont prime?

A) 1 < r < 5 B)0 < r < 4

I do not have OA with me right now .

Hi,

A) 1<r<5 Since r is an integer , then the possible values that can take r are : 2,3 and 4. r is a Pierpont prime if r = (2^k)(3^l)+1 r=2 --> r is a Pierpont prime since 2 is prime and 2 can be written as : 2 = (2^0)(3^0) + 1 r=3 --> r is a Pierpont prime since 3 is prime and 3 can be written as : 3 = (2^1)(3^0) + 1 r=4 --> r is NOT a Pierpont prime since 4 is not prime. Hence, This statement alone is Insufficient

B) 0<r<4 Since r is an integer, then the possible values that can take r are : 1,2 and 3 AS seen in Statement 1 , 2 and 3 are Pierpont prime but 1 is not prime , hence this statement is insufficent itself

A+B) Now, Statements combined, we should have : 1<r<4 that give r the only two possible values : 2 and 3 and both of them are Pierpont prime as seen before

Hence , the answer is Yes . Answer : C

Hi,

Can anyone explain, how can we have 1 as a solution using statement 2, since 2^0 X 3^0 + 1 = 2, so we can never reach 1. So only options left are 2 & 3 so ans should be statement B.

As I see it, the only possibilities are: 2,3,4,5 So the correct answer is A. Can anyone confirm this?

Can anyone explain, how can we have 1 as a solution using statement 2, since 2^0 X 3^0 + 1 = 2, so we can never reach 1. So only options left are 2 & 3 so ans should be statement B.

Dear PuneetSood, I'm happy to respond.

We CAN'T reach 1. That's the point. For any value of r, if r is prime and we can reach it using that formula, it's a Pierpont prime. But if r = 1, which is allowed by Statement #2, then we can't reach that form, and it's not prime anyway, so we get an answer of "no." If r = 1, is r a Pierpont prime? No. By convention, 1 is not a prime number at all. If r = 2, is r a Pierpont prime? Yes If r = 3, is r a Pierpont prime? Yes See: http://magoosh.com/gmat/2012/gmat-math- ... me-number/

Keep in mind the exact logical arrangement. We are not guaranteed that the r we pick will be a Pierpont prime. Instead, we are going to pick any possible r's in that range, and for each one, ask the question, "Is it a Pierpont prime?"

Does this make sense?

ronr34 wrote:

As I see it, the only possibilities are: 2,3,4,5 So the correct answer is A. Can anyone confirm this?

For statement #1, 1 < r < 5, the possible values of r are {2, 3, 4}. The value r = 5 is not a possibility. For these three values, we are asking the question: if r is this value, is it a Pierpoint prime? If r = 2, is r a Pierpont prime? Yes If r = 3, is r a Pierpont prime? Yes If r = 4, is r a Pierpont prime? NO! It's not a prime number at all.

In order to be a Pierpoint prime, a number must (a) be a prime number, and (b) satisfy that equation.

There are plenty of non-prime numbers that satisfy that equation --- for starters, every power of 3 plus 1 (4, 10, 28, 82, 244, etc). If a number isn't prime, it can't be a Pierpont prime.

Does this make sense? Mike
_________________

Mike McGarry Magoosh Test Prep

Education is not the filling of a pail, but the lighting of a fire. — William Butler Yeats (1865 – 1939)

mikemcgarry, if 1 is prime or not is not the question here. The part I did not understood was: How can (2^k)(3^l) be 0?

Since 2^0 = 1 and 3^0 = 1, I dont see how we can get to 1+1=1. Not being able to get to 1 would make B the right answer!

Dear Mascarfi, I'm happy to respond. As I stated above, in order to be a Pierpont prime, an integer must satisfy two conditions: 1) it must be prime 2) it must satisfy the formula.

You are perfectly correct that r = 1 does not satisfy the formula. There is absolutely no way to get it from the formula. I was focusing on the fact that 1 is not prime because that should be immediate. You should know without a moment's reflection that 1 absolutely is not a prime number, and therefore it cannot possibly be a Pierpont prime. You see, even checking whether you can generate it with the formula is more work that you should be doing. You should immediately recognize that 1 is not prime, and that should obviate any calculations. If you have to do even a single calculation, you have done too much to determine that 1 cannot possibly be a Pierpont prime.

The fact that 1 cannot possibly be a Pierpont prime does NOT make Statement #2 sufficient by itself. You see, Statement #2 allows for three values. r = 1 ---> Is it a Pierpont prime? NO! It's not a prime at all. (Also, we can't get it from the formula) r = 2 ---> Is it a Pierpont prime? Yes. r = 3 ---> Is it a Pierpont prime? Yes. Different values of r give us different answers to the prompt, so Statement #2, alone and by itself, is not sufficient.

We need to combine the statements so that only Pierpont primes, 2 and 3, are possible values of r.

Does all this make sense? Mike
_________________

Mike McGarry Magoosh Test Prep

Education is not the filling of a pail, but the lighting of a fire. — William Butler Yeats (1865 – 1939)

Re: A Pierpont prime is any prime number p such that p = (2^k)(3^l) + 1 [#permalink]

Show Tags

15 Sep 2017, 05:34

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Although I got the point of the question, I just have a small query that while solving the question I assumed that any number of the form given in the question is a Pierpont prime and not taking into consideration that the number should also be a prime number. How can we avoid such mistakes happening in future?

Although I got the point of the question, I just have a small query that while solving the question I assumed that any number of the form given in the question is a Pierpont prime and not taking into consideration that the number should also be a prime number. How can we avoid such mistakes happening in future?

Here is the first sentence. A Pierpont primeis any prime number psuch that \(p=(2^k)(3^l)+1\) , where k and l are non-negative integers.

This states quite clearly that a Pierpont prime must be a prime number, not just any number that satisfies the formula.

I have two responses to your question: 1) If a GMAT Quant prompt presents words and a formula, you NEVER can skip the words and jump to the formula. You have to read every word in the prompt with the same precise attention you give each number and formula. The exact wording in Quant prompts is crucial. 2) If you read that sentence and didn't understand its implications, it may be that you need to raise your reading level to excel on GMAT Quant. See: How to Improve Your GMAT Verbal Score

Does all this make sense? Mike
_________________

Mike McGarry Magoosh Test Prep

Education is not the filling of a pail, but the lighting of a fire. — William Butler Yeats (1865 – 1939)

Although I got the point of the question, I just have a small query that while solving the question I assumed that any number of the form given in the question is a Pierpont prime and not taking into consideration that the number should also be a prime number. How can we avoid such mistakes happening in future?

Here is the first sentence. A Pierpont primeis any prime number psuch that \(p=(2^k)(3^l)+1\) , where k and l are non-negative integers.

This states quite clearly that a Pierpont prime must be a prime number, not just any number that satisfies the formula.

I have two responses to your question: 1) If a GMAT Quant prompt presents words and a formula, you NEVER can skip the words and jump to the formula. You have to read every word in the prompt with the same precise attention you give each number and formula. The exact wording in Quant prompts is crucial. 2) If you read that sentence and didn't understand its implications, it may be that you need to raise your reading level to excel on GMAT Quant. See: How to Improve Your GMAT Verbal Score