StmT I
x = 3k+1
y can be anything so dont have SUFF INFO to predict if xy+1 is divisible by 3
INSUFF
Stmt II
y = 9q+8
x can be anything so dont have SUFF INFO to predict if xy+1 is divisible by 3
INSUFF
Together:
xy + 1
(3k+1) (9q+8) + 1
27kq+24k+9q+8 +1
27kq+24k+9q+9
Since each of the terms is divisible by 3 their sum will be divisible by 3 with a remainder of 0
C
integers
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |












