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

It is currently 27 Aug 2014, 05:19

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

If n is a positive integer and r is the remainder when (n-1)

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Intern
Intern
avatar
Joined: 04 Aug 2010
Posts: 15
Followers: 0

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

If n is a positive integer and r is the remainder when (n-1) [#permalink] New post 04 Aug 2010, 02:47
1
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  35% (medium)

Question Stats:

66% (02:40) correct 34% (01:28) wrong based on 73 sessions
If n is a positive integer and r is the remainder when (n-1)(n+1) is divided by 24, what is the value of r?

(1) 2 is not a factor of n
(2) 3 is not a factor of n
[Reveal] Spoiler: OA
Expert Post
3 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 19083
Followers: 3399

Kudos [?]: 24843 [3] , given: 2692

Re: Data Sufficiency with remainder [#permalink] New post 04 Aug 2010, 02:54
3
This post received
KUDOS
Expert's post
kwhitejr wrote:
Can anyone demonstrate the following?

If n is a positive integer and r is the remainder when (n-1)(n+1) is divided by 24, what is the value of r?

(1) 2 is not a factor of n
(2) 3 is not a factor of n


Hi, and welcome to Gmat Club! Below is the solution for your problem:

If n is a positive integer and r is the remainder when (n-1)(n+1) is divided by 24, what is the value of r?

Number plugging method:

(n-1)(n+1)=n^2-1

(1) n is not divisible by 2 --> pick two odd numbers: let's say 1 and 3 --> if n=1, then n^2-1=0 and as zero is divisible by 24 (zero is divisible by any integer except zero itself) so remainder is 0 but if n=3, then n^2-1=8 and 8 divided by 24 yields remainder of 8. Two different answers, hence not sufficient.

(2) n is not divisible by 3 --> pick two numbers which are not divisible by 3: let's say 1 and 2 --> if n=1, then n^2-1=0, so remainder is 0 but if n=2, then n^2-1=3 and 3 divided by 24 yields remainder of 3. Two different answers, hence not sufficient.

(1)+(2) Let's check for several numbers which are not divisible by 2 or 3:
n=1 --> n^2-1=0 --> remainder 0;
n=5 --> n^2-1=24 --> remainder 0;
n=7 --> n^2-1=48 --> remainder 0;
n=11 --> n^2-1=120 --> remainder 0.
Well it seems that all appropriate numbers will give remainder of 0. Sufficient.

Algebraic approach:

(1) n is not divisible by 2. Insufficient on its own, but this statement says that n=odd --> n-1 and n+1 are consecutive even integers --> (n-1)(n+1) must be divisible by 8 (as both multiples are even and one of them will be divisible by 4. From consecutive even integers one is divisible by 4: (2, 4); (4, 6); (6, 8); (8, 10); (10, 12), ...).

(2) n is not divisible by 3. Insufficient on its own, but form this statement either n-1 or n+1 must be divisible by 3 (as n-1, n, and n+1 are consecutive integers, so one of them must be divisible by 3, we are told that it's not n, hence either n-1 or n+1).

(1)+(2) From (1) (n-1)(n+1) is divisible by 8, from (2) it's also divisible by 3, therefore it must be divisible by 8*3=24, which means that remainder upon division (n-1)(n+1) by 24 will be 0. Sufficient.

Answer: C.

Hope it helps.
_________________

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

Manager
Manager
avatar
Joined: 27 May 2010
Posts: 102
Followers: 2

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

GMAT Tests User
Re: Data Sufficiency with remainder [#permalink] New post 04 Aug 2010, 18:14
Thanks for the great explanation Bunuel.
Senior Manager
Senior Manager
User avatar
Status: Time to step up the tempo
Joined: 24 Jun 2010
Posts: 410
Location: Milky way
Schools: ISB, Tepper - CMU, Chicago Booth, LSB
Followers: 7

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

Re: remainder [#permalink] New post 15 Aug 2010, 20:43
tt11234 wrote:
hi all,
please help solving the following question...

if n is a positive integer and r is the remainder when (n+1)(n-1) is divided by 24. what is the value of r?
1) n is not divisible by 2
2) n is not divisible by 3


1) n is not divisible by 2 => n is not even.

n could be 1, 3, 5, 7, 9

and (n+1) * (n-1) could be different values.

2) n is not divisible by 3.

n could be 1, 2, 4, 5, 7, 8, 10...

again (n+1) * (n-1) could be different values.

Combine (1) and (2), n could be 1, 5, 7, 11, 13; ((n+1), (n-1)) would contain a multiple of 6 and 4 when n is 5, 7, 11, 13 ..

When n =1, (n-1) is zero and the remainder is zero.

Multiple of 6 and 4 would contain (3*2) and (2^2) = > (3 * 2 * 2 *2) = > 24.

(n-1)*(n+1) could be 4*6 or 6*8 and either way the remainder when (n-1)*(n+1)/24 would be 0.

Hence both statements is sufficient to answer this.
_________________

:good Support GMAT Club by putting a GMAT Club badge on your blog :thanks

Intern
Intern
User avatar
Joined: 15 Aug 2010
Posts: 23
Location: Mumbai
Schools: Class of 2008, IIM Ahmedabad
Followers: 4

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

Re: remainder [#permalink] New post 15 Aug 2010, 20:47
Statement 1

n is not divisible by 2.

If n = 1, r = 0
If n = 3, r = 8.

Hence, not sufficient.

Statement 2

n is not divisible by 3

If n = 4, r = 15
If n = 5, r = 0

Hence, not sufficient.

Combine both statements.

n can be any of 1,5,7,11,13,17,19 etc.

the respective r will always be 0.

Hence, sufficient.

PS: This way of solving would probably be better in a GMAT hall with a 2 minute time constraint. A rigorous algebraic proof can also be derived otherwise.

Hope this helps. Thanks.
_________________

Naveenan Ramachandran
4GMAT - Mumbai

Manager
Manager
avatar
Joined: 17 May 2010
Posts: 122
Location: United States
Concentration: Entrepreneurship, Marketing
Schools: USC (Marshall) - Class of 2013
GMAT 1: 770 Q50 V46
GPA: 3.26
WE: Brand Management (Consumer Products)
Followers: 6

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

Re: Data Sufficiency with remainder [#permalink] New post 15 Sep 2010, 16:44
I got this problem right (on the GMATPrep #1 CAT) but I'm sure it took me at least 3 minutes, if not closer to 5. At least a minute to set up the problem and figure out how to approach it (the way described above is what I first thought of, but I tried to think of easier ways), another minute to test numbers, and another minute to think of ways on how my test could be wrong.

Any suggestions on how to cut down on timing for unfamiliar problems like these? These divisor/remainder problems always get to me.
_________________

Discipline + Hard Work = Success! 770 (Q50, V46)

Manager
Manager
avatar
Joined: 30 Aug 2010
Posts: 93
Location: Bangalore, India
Followers: 3

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

Re: Data Sufficiency with remainder [#permalink] New post 16 Sep 2010, 23:02
Folks,

Consider this approach.

Stmnt 1: N is not divisible by 2 ==> n=2k+1

==> n-1 * n+1 = 2k(2k+2)=4K(k+1) :note K(K+1) is always divisible by 2 as they are consecutive integers. hence 4K(k+1) is always divisible by 8, but may not be by 24 (i.e. 8*3)....NOT Suff.
Summary from stmnt 1: (n-1)*(n+1) is always divisible by 8

Stmnt 2: N is not divisible by 3 ==> 2 cases -> remainder can be 1 or 2 ==> n=3k+1 or 3K+2

with n=3K+1 ==>
==> n-1 * n+1 = 3k(3k+2)=is divisible by 3 but not by 2 for ODD K: hence not divisible by 24 (i.e. 2^3 * 3)
with n=3K+2 ==>
==> n-1 * n+1 = (3k+1)(3k+3)=3(3k+1)(K+1) is divisible by 3 but not by 2 for EVEN K
Not suff.
Summary from stmnt 2: (n-1)*(n+1) is always divisible by 3

1 & 2 summaries. (n-1)*(n+1) is always divisible by 8*3 = 24..Suff.

Answer "C"


always divisible by 2 as they are consecutive integers. hence 4K(k+1) is always divisible by 8, but may not be by 24 (i.e. 8*3)....NOT Suff.
Intern
Intern
avatar
Joined: 09 Feb 2011
Posts: 12
Followers: 0

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

Divisiblity remainder [#permalink] New post 10 Feb 2011, 23:37
If n is a positive integer and r is the remainder when (n – 1)(n + 1) is divided by 24, what
is the value of r?
(1) 2 is not a factor of n.
(2) 3 is not a factor of

I marked ans e as we cannot find one value while using two other prime 5 & 7. So defainete value of r can be find out. But the ans is c. can anyone confim
Math Forum Moderator
avatar
Joined: 20 Dec 2010
Posts: 2047
Followers: 128

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

GMAT Tests User
Re: Divisiblity remainder [#permalink] New post 11 Feb 2011, 00:16
24 has the factors; 2*2*2*3

If (n-1)(n+1) contains at least the above factors, it will be divisible by 24.

1. Means; n is odd; and n-1 and n+1 are consecutive even;
thus one of them will have at least 2 as factor and the other at least 2*2
Thus; we know (n-1)(n+1) contains 2*2*2 as factor. But, it may or may not contain 3 as its factor.

Not sufficient.

2. if n is not divisible by 3; one of (n-1)(n+1) must be divisible by 3.
One number of any set of 3 consecutive numbers is always divisible by 3.
We know n is not divisible and n-1,n,n+1 are consecutive. if n is not divisible by 3, one of (n-1) and (n+1) must be divisible by 3 or have a factor as 3. However, we don't know whether these numbers have 2*2*2 as factors.

Not sufficient.

Combining both;
(n-1)(n+1) has factors 2*2*2*3 and must be divisible by 24.
Remainder 0.

Sufficient.

Ans: "C"
_________________

~fluke

Get the best GMAT Prep Resources with GMAT Club Premium Membership

Expert Post
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 19083
Followers: 3399

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

Re: Divisiblity remainder [#permalink] New post 11 Feb 2011, 04:01
Expert's post
Merging similar topics.

And again:

!
Please post PS questions in the PS subforum: gmat-problem-solving-ps-140/
Please post DS questions in the DS subforum: gmat-data-sufficiency-ds-141/

No posting of PS/DS questions is allowed in the main Math forum.

_________________

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

Director
Director
avatar
Joined: 03 Aug 2012
Posts: 890
Concentration: General Management, General Management
Schools: ISB '16
GMAT 1: 630 Q47 V29
GMAT 2: 680 Q50 V32
GPA: 3.7
Followers: 12

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

Premium Member CAT Tests
Re: If n is a positive integer and r is the remainder when (n-1) [#permalink] New post 15 Aug 2013, 20:27
REM[ (n-1)*(n+1)]/24

(1).

2 is not a factor of n => n is odd

n=3 => (n-1)*(n+1) = 2*4=8 => REM(8/24) =8
n=5 => (n-1)*(n+1) = 4*6=24 => REM(24/24) =0

Hence INSUFFICIENT

(2).
3 is not a factor of n

n=2 => (n-1)*(n+1) = 1*3=3 => REM(3/24) =3
n=4 => (n-1)*(n+1) = 3*5=15 => REM(15/24) =15

Hence INSUFFICIENT

Combining the two

n=5,7,9,11,13

REM=0

Hence (C) it is
_________________

Rgds,
TGC!
_____________________________________________________________________
I Assisted You => KUDOS Please
_____________________________________________________________________________

Re: If n is a positive integer and r is the remainder when (n-1)   [#permalink] 15 Aug 2013, 20:27
    Similar topics Author Replies Last post
Similar
Topics:
35 Experts publish their posts in the topic If n is a positive integer and r is the remainder when (n-1) enigma123 7 21 Jan 2012, 16:57
1 Experts publish their posts in the topic If n is a positive integer and r is the remainder when (n-1) raulmaldonadomtz 8 03 Jul 2010, 21:19
2 Experts publish their posts in the topic If n is a positive integer and r is the remainder when (n-1) CasperMonday 6 31 Aug 2009, 04:03
If n is a positive integer and r is the remainder when ( n+1 IgnitedMind 5 14 Sep 2008, 18:25
If n is positive, and r is the remainder when (n-1)(n+1) is Loner 1 26 Apr 2006, 12:21
Display posts from previous: Sort by

If n is a positive integer and r is the remainder when (n-1)

  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®.