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

It is currently 25 Jun 2018, 10:36

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

For how many prime numbers p, 2^p+p^2 is a prime?

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

Hide Tags

Retired Moderator
User avatar
P
Status: The best is yet to come.....
Joined: 10 Mar 2013
Posts: 540
GMAT ToolKit User
For how many prime numbers p, 2^p+p^2 is a prime? [#permalink]

Show Tags

New post 18 Aug 2017, 21:46
2
00:00
A
B
C
D
E

Difficulty:

  65% (hard)

Question Stats:

47% (02:31) correct 53% (01:40) wrong based on 79 sessions

HideShow timer Statistics

For how many prime numbers \(p\), \(2^p+p^2\) is a prime?

A. 1
B. 2
C. 3
D. 4
E. 5

_________________

Hasan Mahmud

BSchool Forum Moderator
User avatar
V
Joined: 26 Feb 2016
Posts: 2846
Location: India
GPA: 3.12
Premium Member
Re: For how many prime numbers p, 2^p+p^2 is a prime? [#permalink]

Show Tags

New post 18 Aug 2017, 22:11
Mahmud6 wrote:
For how many prime numbers \(p\), \(2^p+p^2\) is a prime?

A. 1
B. 2
C. 3
D. 4
E. 5


The possibility of prime numbers(p) which yield a prime
number for the expression \(2^p+p^2\) are as follows: 2,3,5,7.....

Let substitute the numbers in the expression and try and find out the value for the expression.

\(2^p+p^2 = 2^2 + 2^2 = 4+4 = 8\) (when p = 2) - 8 is not prime!
\(2^p+p^2 = 2^3 + 3^2 = 8+9 = 17\) (when p = 3) - 17 is prime!
\(2^p+p^2 = 2^5 + 5^2 = 32+25 = 57\) (when p = 5) - 57 is not prime!
\(2^p+p^2 = 2^7 + 7^2 = 128+39 = 177\) (when p = 7) - 177 is not prime!

Of, these numbers only 17 is prime. So, answer should be Option A.

There could be more possibilities for p(2 digit prime and 3 digit primes)
but the calculations will be very tedious.

I have a feeling you could change the question to read single digit primes Mahmud6
or perhaps there is some shorter method to find the answer that I am missing!
_________________

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

Director
Director
User avatar
P
Joined: 13 Mar 2017
Posts: 610
Location: India
Concentration: General Management, Entrepreneurship
GPA: 3.8
WE: Engineering (Energy and Utilities)
For how many prime numbers p, 2^p+p^2 is a prime? [#permalink]

Show Tags

New post 18 Aug 2017, 22:29
Mahmud6 wrote:
For how many prime numbers \(p\), \(2^p+p^2\) is a prime?

A. 1
B. 2
C. 3
D. 4
E. 5


Let y = 2^p + p^2

The prime numbers are 2,3,5,7,11,13

Lets start putting values..from 2
At p= 2, y = 2^2 +2^2 = 8
At p=3 , y = 2^3 + 3^2 = 8 + 9 = 17 is a prime number.
At p =5, y = 2^5 + 5^2 = 32 + 25 = 57 a multiple of 3 is not a prime number is not a prime number
At p = 7 y = 2^7 + 7^2 = 128 +49 = 177 a multiple of 3 is not a prime number
At p =11, y = 2^11 + 11^2 = 2048 + 121 = 2169 a multiple of 3 is not a prime number

So, Probably only p = 3 satisfies the prime number critrea as desired by the question..

Answer A
_________________

CAT 99th percentiler : VA 97.27 | DI-LR 96.84 | QA 98.04 | OA 98.95
UPSC Aspirants : Get my app UPSC Important News Reader from Play store.

MBA Social Network : WebMaggu


Appreciate by Clicking +1 Kudos ( Lets be more generous friends.)



What I believe is : "Nothing is Impossible, Even Impossible says I'm Possible" : "Stay Hungry, Stay Foolish".

Retired Moderator
User avatar
P
Status: The best is yet to come.....
Joined: 10 Mar 2013
Posts: 540
GMAT ToolKit User
Re: For how many prime numbers p, 2^p+p^2 is a prime? [#permalink]

Show Tags

New post 07 Oct 2017, 03:40
pushpitkc wrote:
Mahmud6 wrote:
For how many prime numbers \(p\), \(2^p+p^2\) is a prime?

A. 1
B. 2
C. 3
D. 4
E. 5


The possibility of prime numbers(p) which yield a prime
number for the expression \(2^p+p^2\) are as follows: 2,3,5,7.....

Let substitute the numbers in the expression and try and find out the value for the expression.

\(2^p+p^2 = 2^2 + 2^2 = 4+4 = 8\) (when p = 2) - 8 is not prime!
\(2^p+p^2 = 2^3 + 3^2 = 8+9 = 17\) (when p = 3) - 17 is prime!
\(2^p+p^2 = 2^5 + 5^2 = 32+25 = 57\) (when p = 5) - 57 is not prime!
\(2^p+p^2 = 2^7 + 7^2 = 128+39 = 177\) (when p = 7) - 177 is not prime!

Of, these numbers only 17 is prime. So, answer should be Option A.

There could be more possibilities for p(2 digit prime and 3 digit primes)
but the calculations will be very tedious.

I have a feeling you could change the question to read single digit primes Mahmud6
or perhaps there is some shorter method to find the answer that I am missing!


pushpitkc

For primes greater than 3, \(2^p+p^2\) is always divisible by 3 and is never a prime.

Do you still think, I need to change the question to read single digit primes?
_________________

Hasan Mahmud

2 KUDOS received
DS Forum Moderator
avatar
P
Joined: 22 Aug 2013
Posts: 1209
Location: India
Premium Member
Re: For how many prime numbers p, 2^p+p^2 is a prime? [#permalink]

Show Tags

New post 07 Oct 2017, 04:45
2
Lets look at this this way: Any prime number greater than 3 is of the form either '6K+1' or '6k-1'.

If p= 6k+1, then p^2 = (6k+1)^2 = 36k^2 + 12k + 1. When p= 6k-1, then p^2 = (6k-1)^2 = 36k^2 - 12k + 1. Both these numbers leave a remainder of '1' when divided by 3.

And now look at 2^p. If you observe powers of 2, you will see that any odd power of 2 Always leaves a remainder of '2' when divided by 3 (2^1=2, 2^3=8, 2^5=32.. and so on). Both (6k+1) and (6k-1) are odd: so 2 raised to any of these will always leave a remainder '2' when divided by 3.

So when we add p^2 + 2^p - we are basically adding two numbers: one of which gives a remainder '1' when divided by 3, and another which gives a remainder '2' when divided by 3. In effect, this sum will thus lead to a combined remainder of '3' or '0'. Which means divisible by 3.

So if p is any prime number greater than 3: p^2 + 2^p is always divisible by 3 for values of p which are greater than 3.
We now need to check just for two prime numbers - 2 and 3.

if p=2, then 2^2 + 2^2 is NOT prime
if p=3, then 2^3 + 3^2 = 17, which IS Prime.

So theres only one number - 3 which satisfies this. Hence A answer.
Re: For how many prime numbers p, 2^p+p^2 is a prime?   [#permalink] 07 Oct 2017, 04:45
Display posts from previous: Sort by

For how many prime numbers p, 2^p+p^2 is a prime?

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


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