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.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
16 Sep 2014, 01:52
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
55%
(hard)
Question Stats:
66% (02:53) correct
34%
(02:36)
wrong
based on 80
sessions
History
Date
Time
Result
Not Attempted Yet
A table of numbers has \(n\) rows and \(n\) columns, where \(n\) is an odd integer greater than 4. Each entry in the table is subject to the following rules:
(I) Any entry is the negative of the entry directly above it, if there is an entry directly above it.
(II) Any entry is double the entry directly to its left, if there is an entry directly to its left.
If the entry in the upper left corner (first row and first column) is 1, what is the sum of all the entries in the table?
A. \(0\)
B. \(n^2 - 1\)
C. \(n^2 + 1\)
D. \(2^n - 1\)
E. \(2^n + 1\)
(I) Any entry is the negative of the entry directly above it, if there is an entry directly above it.
(II) Any entry is double the entry directly to its left, if there is an entry directly to its left.
If the entry in the upper left corner (first row and first column) is 1, what is the sum of all the entries in the table?
A. \(0\)
B. \(n^2 - 1\)
C. \(n^2 + 1\)
D. \(2^n - 1\)
E. \(2^n + 1\)
16 Sep 2014, 01:52
Kudos
Bookmarks
Official Solution:
A table of numbers has \(n\) rows and \(n\) columns, where \(n\) is an odd integer greater than 4. Each entry in the table is subject to the following rules:
(I) Any entry is the negative of the entry directly above it, if there is an entry directly above it.
(II) Any entry is double the entry directly to its left, if there is an entry directly to its left.
If the entry in the upper left corner (first row and first column) is 1, what is the sum of all the entries in the table?
A. \(0\)
B. \(n^2 - 1\)
C. \(n^2 + 1\)
D. \(2^n - 1\)
E. \(2^n + 1\)
The best way to approach this problem is to generate an actual table according to the rules. Let's start with the most concrete information we know: the entry in the upper left corner is 1. Now let's build the table to the right and then down.
According to the second rule, entries double as we go to the right, so the first row looks like this:
\(\text{1, 2, 4, 8, 16 ...}\)
According to the first rule, entries "flipflop" in sign (+/-) as we go down the table. So the first five rows and columns look like this:
\(\text{1, 2, 4, 8, 16}\)
\(\text{-1, -2, -4, -8, -16}\)
\(\text{1, 2, 4, 8, 16}\)
\(\text{-1, -2, -4, -8, -16}\)
\(\text{1, 2, 4, 8, 16}\)
Since \(n\) is an odd integer greater than 4, we can choose \(n = 5\) and stop here.
The process of adding up all the entries benefits from cancellation. The first four rows cancel each other out completely. All that is left is the last row, which sums up as follows: \(1 + 2 + 4 + 8 + 16 = 31\). Plugging \(n = 5\) into the answer choices, we get the following:
(A) \(0\) INCORRECT
(B) \(n^2 - 1 = 5^2 - 1 = 24\) INCORRECT
(C) \(n^2 + 1 = 5^2 + 1 = 26\) INCORRECT
(D) \(2^n - 1 = 2^5 - 1 = 31\) CORRECT
(E) \(2^n + 1 = 2^5 + 1 = 33\) INCORRECT
We can prove that \(2^n - 1\) is the general formula for the sum of 1, 2, 4, etc. up to \(2^{n - 1}\) (which will be the last entry in the last row), but there is no need to do so.
Answer: D
A table of numbers has \(n\) rows and \(n\) columns, where \(n\) is an odd integer greater than 4. Each entry in the table is subject to the following rules:
(I) Any entry is the negative of the entry directly above it, if there is an entry directly above it.
(II) Any entry is double the entry directly to its left, if there is an entry directly to its left.
If the entry in the upper left corner (first row and first column) is 1, what is the sum of all the entries in the table?
A. \(0\)
B. \(n^2 - 1\)
C. \(n^2 + 1\)
D. \(2^n - 1\)
E. \(2^n + 1\)
The best way to approach this problem is to generate an actual table according to the rules. Let's start with the most concrete information we know: the entry in the upper left corner is 1. Now let's build the table to the right and then down.
According to the second rule, entries double as we go to the right, so the first row looks like this:
\(\text{1, 2, 4, 8, 16 ...}\)
According to the first rule, entries "flipflop" in sign (+/-) as we go down the table. So the first five rows and columns look like this:
\(\text{1, 2, 4, 8, 16}\)
\(\text{-1, -2, -4, -8, -16}\)
\(\text{1, 2, 4, 8, 16}\)
\(\text{-1, -2, -4, -8, -16}\)
\(\text{1, 2, 4, 8, 16}\)
Since \(n\) is an odd integer greater than 4, we can choose \(n = 5\) and stop here.
The process of adding up all the entries benefits from cancellation. The first four rows cancel each other out completely. All that is left is the last row, which sums up as follows: \(1 + 2 + 4 + 8 + 16 = 31\). Plugging \(n = 5\) into the answer choices, we get the following:
(A) \(0\) INCORRECT
(B) \(n^2 - 1 = 5^2 - 1 = 24\) INCORRECT
(C) \(n^2 + 1 = 5^2 + 1 = 26\) INCORRECT
(D) \(2^n - 1 = 2^5 - 1 = 31\) CORRECT
(E) \(2^n + 1 = 2^5 + 1 = 33\) INCORRECT
We can prove that \(2^n - 1\) is the general formula for the sum of 1, 2, 4, etc. up to \(2^{n - 1}\) (which will be the last entry in the last row), but there is no need to do so.
Answer: D
