IMO A
t^2 + 5t + 6
= t^2 + 3t + 2t +6
=(t+2)(t+3),
Stmnt 1 = t gives remainder of 6 when divided by 7.
=> t+1 is a multiple of 7.
So t+2 will give 1 as remainder and t+3 will give 2 as remainder.
Hence remainder of (t+2)(t+3) will give remainder as 1 * 2 = 2 always.
Sufficient.
stmnt 2 : t^2 gives remainder of 1 when divided by 7
we cant find the remander when t is divided by 7 .. insufficient
GMAT Prep - DS
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
rahulmehra13
- Senior | Next Rank: 100 Posts
- Posts: 38
- Joined: Wed Jul 22, 2009 8:49 am
- Thanked: 4 times
