Find all School-related info fast with the new School-Specific MBA Forum

It is currently 29 Aug 2014, 23:01

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

What is the remainder when the positive integer n is divided

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
2 KUDOS received
Intern
Intern
avatar
Joined: 09 Dec 2009
Posts: 34
Followers: 0

Kudos [?]: 5 [2] , given: 7

What is the remainder when the positive integer n is divided [#permalink] New post 25 Jun 2010, 22:42
2
This post received
KUDOS
1
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  25% (medium)

Question Stats:

63% (01:54) correct 37% (00:54) wrong based on 127 sessions
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
[Reveal] Spoiler: OA

Last edited by Bunuel on 12 Nov 2012, 02:26, edited 1 time in total.
Renamed the topic and edited the question.
Expert Post
4 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 25206
Followers: 3419

Kudos [?]: 25049 [4] , given: 2702

Re: GMAT prep DS- Remainder [#permalink] New post 26 Jun 2010, 07:45
4
This post received
KUDOS
Expert's post
What is the remainder when the positive integer n is divided by the positive integer k, where k>1

(1) n=(k+1)^3= k^3 + 3k^2 + 3k + 1=k(k^2+3k+3)+1 --> first term, k(k^2+3k+3), is obviously divisible by k and 1 divide by k yields the remainder of 1 (as k>1). Sufficient.

(2) k=5. Know nothing about n, hence insufficient.

Answer: A.
_________________

NEW TO MATH FORUM? PLEASE READ THIS: ALL YOU NEED FOR QUANT!!!

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders; 11. GMAT Prep Software Analysis NEW!!!; 12. SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) NEW!!!; 12. Tricky questions from previous years. NEW!!!;

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
25 extra-hard Quant Tests

Get the best GMAT Prep Resources with GMAT Club Premium Membership

Intern
Intern
avatar
Joined: 24 Nov 2008
Posts: 6
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: GMAT prep DS- Remainder [#permalink] New post 26 Jun 2010, 16:06
Yep A. Nice explanation Bunuel.
2 KUDOS received
Kaplan GMAT Instructor
User avatar
Joined: 21 Jun 2010
Posts: 75
Location: Toronto
Followers: 21

Kudos [?]: 102 [2] , given: 2

Re: GMAT prep DS- Remainder [#permalink] New post 29 Jun 2010, 18:33
2
This post received
KUDOS
bunuel's solution is certainly the quickest way to solve. (Of course, it would be (k+1)^3 = k^3 + 3k^2 + 3k + 1, and since each of the "k" terms is divisible by k, the remainder is 1).

But if this deduction/concept didn't jump out at you, you could also solve fairly quickly by picking numbers. If we pick different integer values for k and always end up with the same remainder for n/k, then we can trust that (1) is sufficient. On the other hand, if ever we get different remainder values, we know at once (1) is insufficient:

(1): let k=2. Then, n = (2+1)^3 = 27. 27/2 leaves a remainder of 1.
----let k=3. Then, n = (3+1)^3 = 64. 63 is clearly divisible by 3. Thus, 64/3 leaves a remainder of 1 again.
----let k=4. Then, n = (4+1)^3 = 125. 124 is clearly divisible by 4. Thus, 125/4 leaves a remainder of 1 again.

We've convinced ourselves that (1) is sufficient!
_________________

Kaplan Teacher in Toronto
http://www.kaptest.com/GMAT

Prepare with Kaplan and save $150 on a course!

Image

Kaplan Reviews

Intern
Intern
avatar
Joined: 22 Jun 2010
Posts: 42
Followers: 0

Kudos [?]: 22 [0], given: 1

Re: DS question [#permalink] New post 31 Jul 2010, 06:57
Samarth0711 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

Answer given is (A) - Need solution.



1 sufficient

n=3k + 3 ==> reminder is 3
Intern
Intern
avatar
Joined: 25 Apr 2010
Posts: 6
Followers: 0

Kudos [?]: 0 [0], given: 2

Re: DS question [#permalink] New post 31 Jul 2010, 09:25
Its (k+1) cubed and not 3 multiplied by (K+1)
Intern
Intern
avatar
Joined: 22 Jun 2010
Posts: 42
Followers: 0

Kudos [?]: 22 [0], given: 1

Re: DS question [#permalink] New post 31 Jul 2010, 09:29
Samarth0711 wrote:
Its (k+1) cubed and not 3 multiplied by (K+1)


it is likely the same

n=(k+1)^3 ==> n=k^3 + 3k²+3k+1 ==> n=k(K²+3k+3) +1 so the reminder is 1

DO you agree ?
Intern
Intern
avatar
Joined: 12 Jun 2012
Posts: 42
Followers: 1

Kudos [?]: 19 [0], given: 28

What is the remainder when the positive integer n is divided [#permalink] New post 12 Nov 2012, 02:13
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
_________________

If you find my post helpful, please GIVE ME SOME KUDOS!

Expert Post
1 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 25206
Followers: 3419

Kudos [?]: 25049 [1] , given: 2702

Re: What is the remainder when the positive integer n is divided [#permalink] New post 12 Nov 2012, 10:03
1
This post received
KUDOS
Expert's post
Manager
Manager
avatar
Joined: 01 Jan 2013
Posts: 68
Location: India
Followers: 0

Kudos [?]: 11 [0], given: 129

GMAT ToolKit User CAT Tests
Re: What is the remainder when the positive integer n is divided [#permalink] New post 11 Nov 2013, 09:04
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



(k+1)^3

Take any value of k(for eg 8)
K= 8 ; 9^3/8 = (1^3)/9 = 1(because each value of 9/8 gives remainder 1.Hence 1 X 1 X 1)
k = 2 ; 3^3/2 = (1^3)/2 = 1
etc.A sufficient

b) Insufficient
OA A
Re: What is the remainder when the positive integer n is divided   [#permalink] 11 Nov 2013, 09:04
    Similar topics Author Replies Last post
Similar
Topics:
What is the remainder when positive integer N is divided by arjtryarjtry 2 21 Jul 2008, 23:12
What is the remainder when the positive integer n is divided Balvinder 5 24 May 2007, 05:46
What is the remainder when positive Integer n is divided by GmatInstinct 2 25 Sep 2006, 16:01
What is the remainder when the positive integer n is divided sperumba 9 18 Jan 2006, 18:58
What is the remainder when the positive integer n is divided mandy 9 03 Aug 2005, 05:35
Display posts from previous: Sort by

What is the remainder when the positive integer n is divided

  Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.