What is the remainder when the positive integer n is divided by the positive integer k, where k>1?
(1) n = (k+1)^3
(2) k = 5
OA is A
(1) n = (k+1)^3
(2) k = 5
OA is A
GMAX
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
DanaJ, we are all very lucky to have you on board! Thanks for the great work you are doing on this forum. It is joy to read and learn from your posts. I am sure I talk for everbody on this forum.DanaJ wrote:We are looking for the remainder of n being divided by k.
1. It's useful to know that the formula for raising (a + b) to the third power:
(a + b)^3 = a^3 + 3a^2b + 3ab^2+ b^3.
This means that n will be k^3 + 3k^2 + 3k + 1. Now, you can clearly see that the remainder will be 1 here, since k^3, 3k^2 and 3k are all divisible by k.
2. is insufficient. Knowing k = 5 is not enough: we also need some info about n.
New here Create free account