还没有登录哦！

[Problem Solving]

试题详情

题目：

Two illustrations show arrays of dots. The first illustration shows a 5 by 5 array of dots. The first 3 dots in the second, third, and fourth rows form a 3 by 3 grid, which is enclosed in a square. A text below the illustration reads n equals 5, k equals 3. The second illustration shows a 3 by 3 array of dots. The first dot in the second row is enclosed in a square. A text below the illustration reads n equals 3, k equals 1.

Let n and k be positive integers with k ≤ n. From an n × n array of dots, a k × k array of dots is selected. The figure above shows two examples where the selected k × k array is enclosed in a square. How many pairs (n, k) are possible so that exactly 48 of the dots in the n × n array are NOT in the selected k × k array?

选项:

A、1
B、2
C、3
D、4
E、5

答案:

C

提问：

没看懂题目不知道怎么下手

解答：

点赞0
阅读1281
解答： 徐小梅

提问：

没看懂题目不知道怎么下手

解答：

点赞0
阅读1282
解答： 徐小梅老师

问个问题

注册太麻烦？点这里查看免费答疑吧！

学长故事

免扫码试听

24小时随身答疑小程序

GMAT每日一题

点我领取
免费专项课程
 在线咨询