Last visit was: 24 Jul 2024, 11:09 It is currently 24 Jul 2024, 11:09
Close
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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
SORT BY:
Date
Tags:
Show Tags
Hide Tags
avatar
Intern
Intern
Joined: 09 Dec 2009
Posts: 21
Own Kudos [?]: 119 [107]
Given Kudos: 7
Send PM
Most Helpful Reply
Math Expert
Joined: 02 Sep 2009
Posts: 94607
Own Kudos [?]: 643591 [46]
Given Kudos: 86737
Send PM
User avatar
Kaplan GMAT Instructor
Joined: 21 Jun 2010
Posts: 55
Own Kudos [?]: 459 [28]
Given Kudos: 2
Location: Toronto
Send PM
General Discussion
Manager
Manager
Joined: 10 Apr 2018
Posts: 185
Own Kudos [?]: 457 [7]
Given Kudos: 115
Location: United States (NC)
Send PM
Re: What is the remainder when the positive integer n is divided by the po [#permalink]
4
Kudos
3
Bookmarks
Hi,

Here are my two cents for this question.


if \(\frac{(ax+1)^n}{a}\) remainder is always 1 ----------(I)

eg \(\frac{(37)^{261}}{9}\) = \(\frac{(9*4+1)^{261}}{9}\) in which case remainder is \(\frac{(1)^{261}}{9}\) which is 1 .

or from above we could see it has same form as \(\frac{(ax+1)^n}{a}\) so reminder is 1.

So this question is using the above logic.

So we can say our Answer to this question is A.

More on this you can find at

https://gmatclub.com/forum/using-remain ... l#p2243712
Director
Director
Joined: 14 Jul 2010
Status:No dream is too large, no dreamer is too small
Posts: 959
Own Kudos [?]: 5019 [1]
Given Kudos: 690
Concentration: Accounting
Send PM
Re: What is the remainder when the positive integer n is divided by the po [#permalink]
1
Kudos
Top Contributor
JoyLibs 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


Plugging in number;
1) Let, k= 2
so, n = 27, and 27/2; remainder is 1
K= 3, n=64; 64/3; remainder is 1
Thus A is sufficient.

2) No information about N is given. ; insufficient

The answer is A.
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 10133
Own Kudos [?]: 17059 [0]
Given Kudos: 4
GMAT 1: 760 Q51 V42
GPA: 3.82
Send PM
Re: What is the remainder when the positive integer n is divided by the po [#permalink]
Expert Reply
Forget the conventional way to solve DS questions.

We will solve this DS question using the variable approach.

Remember the relation between the Variable Approach, and Common Mistake Types 3 and 4 (A and B)[Watch lessons on our website to master these approaches and tips]

Step 1: Apply Variable Approach(VA)

Step II: After applying VA, if C is the answer, check whether the question is key questions.

StepIII: If the question is not a key question, choose C as the probable answer, but if the question is a key question, apply CMT 3 and 4 (A or B).

Step IV: If CMT3 or 4 (A or B) is applied, choose either A, B, or D.

Let's apply CMT (2), which says there should be only one answer for the condition to be sufficient. Also, this is an integer question and, therefore, we will have to apply CMT 3 and 4 (A or B).

To master the Variable Approach, visit https://www.mathrevolution.com and check our lessons and proven techniques to score high in DS questions.

Let’s apply the 3 steps suggested previously. [Watch lessons on our website to master these 3 steps]

Step 1 of the Variable Approach: Modifying and rechecking the original condition and the question.

We have to find the remainder when the positive integer n is divided by the positive integer, where k >1.

Second and the third step of Variable Approach: From the original condition, we have 2 variables (n and k). To match the number of variables with the number of equations, we need 2 equations. Since conditions (1) and (2) will provide 1 equation each, C would most likely be the answer.

But we know that this is a key question [Integer question] and if we get an easy C as an answer, we will choose A or B.

Let’s take a look at each condition.

Condition(1) tells us that n = \((k + 1)^3\).

=> \(k^3\) is always divisible by k

=> If k = 2 then \(k^3\) = \(2^3\) = 8. => 8 is divisible by 2.

=> If k = 5 then \(k^3 = 5^3\) = 125. => 125 is divisible by 5.

=> \((k + 1)^3\) = \(k^3 + 3k^2\)+3K+1 [\(k^2\) and 3k is always divisible by k]

Hence \((k+1)^3\) will always give '1' as a remainder when divided by K.

Since the answer is unique, the condition is sufficient by CMT 2.


Condition(2) tells us that K = 5.

=> We have no information on 'n'.

Since the answer is not unique, the condition is not sufficient by CMT 2.

Condition (1) is alone sufficient.

So, A is the correct answer.

Answer: A
Senior Manager
Senior Manager
Joined: 25 Aug 2020
Posts: 250
Own Kudos [?]: 145 [1]
Given Kudos: 216
Send PM
Re: What is the remainder when the positive integer n is divided by the po [#permalink]
1
Kudos
JoyLibs 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



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

Remainder = \(\frac{(k + 1)^3}{k}\) = \(\frac{(k + 1)*(k + 1)*(k + 1)}{k}\) = \(\frac{1}{k}\)*\(\frac{1}{k}\)*\(\frac{1}{k}\) =\(\frac{1}{k}\)

Remainder is "1" Thus, Statement 1 is sufficient.

2st. k = 5 - no info about "n" hence, insufficient.
User avatar
Non-Human User
Joined: 09 Sep 2013
Posts: 34067
Own Kudos [?]: 853 [0]
Given Kudos: 0
Send PM
Re: What is the remainder when the positive integer n is divided by the po [#permalink]
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
GMAT Club Bot
Re: What is the remainder when the positive integer n is divided by the po [#permalink]
Moderator:
Math Expert
94606 posts