Events & Promotions
|
|
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.
May 1212:00 PM EDT
-11:59 PM EDT
Make the most of your break with the most realistic GMAT™ prep. Take up to $700 off select products.
May 1501:00 PM IST
-11:00 AM IST
Start your journey with a fully customized action plan and work with a dedicated mentor to achieve a 735+ score.
May 1810:00 AM PDT
-11:00 AM PDT
Join us in a live GMAT practice session and solve 25 challenging GMAT questions with other test takers in timed conditions, covering GMAT Quant, Data Sufficiency, Data Insights, Reading Comprehension, and Critical Reasoning questions.- May 19
12:00 PM PDT
-01:00 PM PDT
Scoring 329 on the GRE is not always about using more books, more courses, or a longer study plan. In this episode of GRE Success Talks, Ashutosh shares his GRE preparation strategy, study plan, and test-day experience, explaining how he kept his prep.... - Jun 10
06:00 AM PDT
-06:15 PM PDT
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..
02 Dec 2021, 04:21
Kudos
Bookmarks
If \(n\) and \(k\) are positive integers, then how many ordered pairs \((n, k)\) satisfy \(n! + 8 = 2^k\) ?
A. \(0\)
B. \(1\)
C. \(2\)
D. \(3\)
E. Infinitely many
A. \(0\)
B. \(1\)
C. \(2\)
D. \(3\)
E. Infinitely many
02 Dec 2021, 04:21
Kudos
Bookmarks
Official Solution:
If \(n\) and \(k\) are positive integers, then how many ordered pairs \((n, k)\) satisfy \(n! + 8 = 2^k\) ?
A. \(0\)
B. \(1\)
C. \(2\)
D. \(3\)
E. Infinitely many
\(n! + 8 = 2^k\);
\(n! = 2^k-8\);
\(n! = 2^k-2^3\);
\(n! = 2^3(2^{k-3}-1)= 2^3*odd\).
\(n! = 2^3*odd\) means that \(n! \geq 8\), thus \(n \geq 4\).
\(n! = 2^3*odd\) also means that \(2^3\) is the highest power of 2 that can divide \(n!\). This on the other hand means that \(n \leq 5\) (if \(n > 5\), then \(n!\) will have more than three 2's).
So, we get that \(4 \leq n \leq 5\).
If \(n = 4\), then \(k=5\).
If \(n = 5\), then \(k=7\).
Thus, \((n, k)\) can only be \((4, 5)\) and \((5, 7)\)
Answer: C
If \(n\) and \(k\) are positive integers, then how many ordered pairs \((n, k)\) satisfy \(n! + 8 = 2^k\) ?
A. \(0\)
B. \(1\)
C. \(2\)
D. \(3\)
E. Infinitely many
\(n! + 8 = 2^k\);
\(n! = 2^k-8\);
\(n! = 2^k-2^3\);
\(n! = 2^3(2^{k-3}-1)= 2^3*odd\).
\(n! = 2^3*odd\) means that \(n! \geq 8\), thus \(n \geq 4\).
\(n! = 2^3*odd\) also means that \(2^3\) is the highest power of 2 that can divide \(n!\). This on the other hand means that \(n \leq 5\) (if \(n > 5\), then \(n!\) will have more than three 2's).
So, we get that \(4 \leq n \leq 5\).
If \(n = 4\), then \(k=5\).
If \(n = 5\), then \(k=7\).
Thus, \((n, k)\) can only be \((4, 5)\) and \((5, 7)\)
Answer: C
13 Apr 2025, 00:58
Kudos
Bookmarks
Hi Bunuel, I didn't understand this part
" This on the other hand means that n≤5 "
" This on the other hand means that n≤5 "
