|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
04 Dec 2019, 01:01
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
45% (02:35) correct
55%
(02:46)
wrong
based on 266
sessions
History
Date
Time
Result
Not Attempted Yet
The function f(x) represents the number of ways that prime numbers can be uniquely summed to form a certain number x such that x = a + b + c + d… where those summed variables are each prime and a ≤ b ≤ c ≤ d ... For instance f(8) = 3 and the unique ways are 2 + 2 + 2 + 2 and 2 + 3 + 3 and 3 + 5. What is f(12)?
A. 4
B. 5
C. 6
D. 7
E. 8
Are You Up For the Challenge: 700 Level Questions
A. 4
B. 5
C. 6
D. 7
E. 8
Are You Up For the Challenge: 700 Level Questions
Updated on: 04 Dec 2019, 02:03
Originally posted by rajatchopra1994 on 04 Dec 2019, 01:12.
Last edited by rajatchopra1994 on 04 Dec 2019, 02:03, edited 1 time in total.
Last edited by rajatchopra1994 on 04 Dec 2019, 02:03, edited 1 time in total.
Kudos
Bookmarks
Bunuel
Explanation:
F(12)=
2+2+2+2+2+2------1
2+2+2+3+3-----2
2+2+3+5----3
2+3+7-----4
3+3+3+3-----5
5+7-----6
2+5+5-----7 (Corrected)
Total = 7
F(12)=7
IMO-D
Please Give Kudos, If you find my explanation Good Enough General Discussion
04 Dec 2019, 01:55
Kudos
Bookmarks
One more 5+5+2 , total 7
Posted from my mobile device
Posted from my mobile device
