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 2008:00 AM PDT
-08:30 AM PDT
What’s in it for you- Live Profile Evaluation Chat Session with Jenifer Turtschanow, CEO, ARINGO. Come with your details prepared and ARINGO will share insights! Pre-MBA Role/Industry, YOE, Exam Score, C/GPA, ECs Post-MBA Role/ Industry & School List.
Jun 1006: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..
20 Jan 2024, 09:30
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
25%
(medium)
Question Stats:
78% (01:53) correct
22%
(02:01)
wrong
based on 77
sessions
History
Date
Time
Result
Not Attempted Yet
How many positive n-digit integers, where n is greater than 1, can be formed using nonzero digits such that no two adjacent digits are the same?
A. n^8
B. n^9
C. 8^n
D. 9*8^(n-1)
E. 9^n
A. n^8
B. n^9
C. 8^n
D. 9*8^(n-1)
E. 9^n
22 Jan 2024, 01:30
Kudos
Bookmarks
How many positive \(n\)-digit integers, where \(n\) is greater than 1, can be formed using nonzero digits such that no two adjacent digits are the same?
A. \(n^8\)
B. \(n^9\)
C. \(8^n\)
D. \(9*8^{(n-1)}\)
E. \(9^n\)
The first digit can take 9 values, from 1 to 9, inclusive.
The next digit can take 8 values, any but the one used for the first digit.
The following digit can also take 8 values, any but the one used for the second digit.
The subsequent digit can also take 8 values, any but the one used for the third digit.
...
And finally, the last, \(n_{th}\) digit can take 8 values, any but the one used for the second to last digit.
Hence, we have 9 options for the first digit and 8 options for each of the remaining \(n-1\) digits, resulting in a total of \(9*8^{(n-1)}\) numbers.
Answer: D
A. \(n^8\)
B. \(n^9\)
C. \(8^n\)
D. \(9*8^{(n-1)}\)
E. \(9^n\)
The first digit can take 9 values, from 1 to 9, inclusive.
The next digit can take 8 values, any but the one used for the first digit.
The following digit can also take 8 values, any but the one used for the second digit.
The subsequent digit can also take 8 values, any but the one used for the third digit.
...
And finally, the last, \(n_{th}\) digit can take 8 values, any but the one used for the second to last digit.
Hence, we have 9 options for the first digit and 8 options for each of the remaining \(n-1\) digits, resulting in a total of \(9*8^{(n-1)}\) numbers.
Answer: D
General Discussion
20 Jan 2024, 09:42
Kudos
Bookmarks
Bunuel
Let's assume n = 2
_ _
- The first place can be filled in 9 ways (any digit between 1 and 9, both inclusive).
- The second place can be filled in 8 ways (any digit between 1 and 9, both inclusive, except the one used in the first place.
- Number of ways = 9 * 8 = \(9 * 8^1\)
Let's assume n = 3
_ _ _
- The first place can be filled in 9 ways (any digit between 1 and 9, both inclusive).
- The second place can be filled in 8 ways (any digit between 1 and 9, both inclusive, except the one used in the first place.
- The third place can be filled in 8 ways (any digit between 1 and 9, both inclusive, except the one used in the second place.
- Number of ways = 9 * 8 * 8 = \(9 * 8^2\)
Hence, we can infer that the pattern for n-digit integer is ⇒ \(9 * 8^{n-1}\)
Option D
