right wrong
Pick an answer to see how members did
Log this miss in the free GMAT error log
Get the error logGet one like this every day: the free 60-day plan
Start the planA. 1
B. 2
C. 3
D. 4
E. 5
Answer: C
Source: Official Guide
Live GMAT classes with Target Test Prep start Nov 21 and Nov 22. First class free.
See classesLearn live with an expert or move at your own pace. Every option includes the complete TTP study system.
Target Test Prep was voted #1 Best Test Prep in the 2026 Newsweek Readers’ Choice™ Awards.
with Josh Braslow, 20+ years in test prep
Self-paced EA prep. Study on your schedule.
with
Complete access from day one. Study on your schedule.
right wrong
Pick an answer to see how members did
Log this miss in the free GMAT error log
Get the error logGet one like this every day: the free 60-day plan
Start the planIn general, an n x n array will have a total of n² dotsM7MBA wrote: ↑Fri Feb 19, 2021 8:49 am2019-09-21_1528.png
Let \(n\) and \(k\) be positive integers with \(k \le n.\) From an \(n \times n\) array of dots, a \(k \times k\) array of dots is selected. The figure above shows two examples where the selected \(k \times k\) array is enclosed in a square. How many pairs \((n, k)\) are possible so that exactly \(48\) of the dots in the \(n \times n\) array are NOT in the selected \(k \times k\) array?
A. 1
B. 2
C. 3
D. 4
E. 5
Answer: C
Source: Official Guide