is n — 1 divisible by 3?

This topic has expert replies
Source: — Data Sufficiency |

User avatar
Legendary Member
Posts: 1560
Joined: Tue Nov 17, 2009 2:38 am
Thanked: 137 times
Followed by:5 members

by thephoenix » Mon Apr 05, 2010 9:43 am
imo a

s1) =n(n+1) any value of n for which n(n+1) is not div by 3 n-1 will be div by 3
suff
s2)i tried alot and think its in suff

User avatar
Master | Next Rank: 500 Posts
Posts: 435
Joined: Mon Mar 15, 2010 6:15 am
Thanked: 32 times
Followed by:1 members

by eaakbari » Mon Apr 05, 2010 11:58 am
Statement one
Since n and n+1 are not divisible then obviously n-1 will be divisible by 3. Suff

Statement two

3n + 5 >= k + 8
3n>= 3.c +3 (let k = 3.c)

n>= c+ 1
which does not tell us anything

Hence Insuff

IMO A

Senior | Next Rank: 100 Posts
Posts: 65
Joined: Wed Nov 25, 2009 6:33 pm
Thanked: 3 times

by dxgamez » Mon Apr 05, 2010 7:34 pm
see this post by Stuart. very useful to see why statement 1 is insufficient in one glance.

https://www.beatthegmat.com/divisibility ... tml#240208

User avatar
Master | Next Rank: 500 Posts
Posts: 435
Joined: Mon Mar 15, 2010 6:15 am
Thanked: 32 times
Followed by:1 members

by eaakbari » Mon Apr 05, 2010 9:26 pm
dxgamez wrote:see this post by Stuart. very useful to see why statement 1 is insufficient in one glance.

https://www.beatthegmat.com/divisibility ... tml#240208

The question is different and its the same logic that it applied. When you have n , n-1 and n+ 1 , one of them have to be a multiple of 3. Plug in any number and you will see thats the case. Since we are given n and n+1 are not divisible by 3 then definitely n -1 is

User avatar
Legendary Member
Posts: 1560
Joined: Tue Nov 17, 2009 2:38 am
Thanked: 137 times
Followed by:5 members

by thephoenix » Mon Apr 05, 2010 9:28 pm
dxgamez wrote:see this post by Stuart. very useful to see why statement 1 is insufficient in one glance.

https://www.beatthegmat.com/divisibility ... tml#240208
yes and for the very same reason here s1 is suff....

User avatar
GMAT Instructor
Posts: 3225
Joined: Tue Jan 08, 2008 2:40 pm
Location: Toronto
Thanked: 1710 times
Followed by:614 members
GMAT Score:800

by Stuart@KaplanGMAT » Mon Apr 05, 2010 9:42 pm
thephoenix wrote:
dxgamez wrote:see this post by Stuart. very useful to see why statement 1 is insufficient in one glance.

https://www.beatthegmat.com/divisibility ... tml#240208
yes and for the very same reason here s1 is suff....
Correct - the logic applied in that thread proves that (1) is sufficient, not insufficient.

(1) breaks down to n(n+1) is NOT a multiple of 3, which means that neither n nor (n+1) is a multiple of 3.

Since one of (n-1), n and (n+1) must be a multiple of 3, by default (n-1) must be divisible by 3.
Image

Stuart Kovinsky | Kaplan GMAT Faculty | Toronto

Kaplan Exclusive: The Official Test Day Experience | Ready to Take a Free Practice Test? | Kaplan/Beat the GMAT Member Discount
BTG100 for $100 off a full course

Newbie | Next Rank: 10 Posts
Posts: 6
Joined: Mon Apr 05, 2010 11:22 pm

by istuti » Tue Apr 06, 2010 2:40 am
Just wish to cross-check, we'd okay 0 as div by 3 right?

User avatar
GMAT Instructor
Posts: 3225
Joined: Tue Jan 08, 2008 2:40 pm
Location: Toronto
Thanked: 1710 times
Followed by:614 members
GMAT Score:800

by Stuart@KaplanGMAT » Tue Apr 06, 2010 8:09 am
istuti wrote:Just wish to cross-check, we'd okay 0 as div by 3 right?
0 is divisible by (i.e. is a multiple of) everything except 0.
Image

Stuart Kovinsky | Kaplan GMAT Faculty | Toronto

Kaplan Exclusive: The Official Test Day Experience | Ready to Take a Free Practice Test? | Kaplan/Beat the GMAT Member Discount
BTG100 for $100 off a full course