What is the remainder when the positive integer n is divided

This topic has expert replies
Source: — Data Sufficiency |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3008
Joined: Mon Aug 22, 2016 6:19 am
Location: Grand Central / New York
Thanked: 470 times
Followed by:34 members

by Jay@ManhattanReview » Tue Sep 24, 2019 9:10 pm
BTGmoderatorDC wrote: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 A

Source: GMAT Prep
Let's take each statement one by one.

(1) n = (k+1)^3

n = k^3 + 3k^2 + 3k + 1

=> n/k = k^2 + 3k + 3 + 1/k

Thus, the remainder is 1. Sufficient.

(2) k = 5

Since do not have the finite value of n, we can't get the unique answer. Insufficient.

The correct answer: A

Hope this helps!

-Jay
_________________
Manhattan Review GMAT Prep

Locations: GMAT Classes Singapore | GMAT Tutoring Zurich | GRE Prep Hyderabad | TOEFL Prep Classes Manhattan | and many more...

Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.

Legendary Member
Posts: 2499
Joined: Sun Oct 29, 2017 2:04 pm
Followed by:6 members

by swerve » Tue Oct 01, 2019 6:31 am
BTGmoderatorDC wrote: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 A

Source: GMAT Prep
A is sufficient

\(n = (k + 1 )^3\)
Randomly put values \(k > 1\) i.e. 2, 3, 4, 5, 6, 7...
\(n = (2+1)^3 = 27\)
\(\frac{n}{k} = \frac{27}{2} =\) remainder 1

same as for 3,4,5,6,7,8...

so A is sufficient.

B. No details available

Therefore, A is the correct answer.