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.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Re: If x and y are integers, is xy + 1 divisible by 3?
[#permalink]
Show Tags
09 Dec 2014, 20:00
1
1
If x and y are integers, is xy + 1 divisible by 3?
(1) When x is divided by 3, the remainder is 1 --> x=3n+1, if x=1, then 1*y+1 when y=1 not div by 3 and when y=2 div by 3 => insufficient (2) When y is divided by 9, the remainder is 8 -->y=9m+8, if y=1, then x*1+1 when x=1 not div by 9 and when x=8 div by 9 => insufficient
(1) + (2) : x=3n+1 and y=9m+8 where m and n are integers=> xy+1=(3n+1)(9m+8)+1 =27mn+9m+24n+8+1 =27mn+9m+24n+9 => this is div by 3 always hence is sufficient => C
Ans. C)
_________________
Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time. - Thomas A. Edison
Re: If x and y are integers, is xy + 1 divisible by 3?
[#permalink]
Show Tags
09 Dec 2014, 20:15
Given x and y are integers. We have to find out whether xy+1 is divisible by 3 ?
Statement 1: When x is divided by 3, the remainder is 1
Therefore, x can be represented as 3*a+1 ( where a is an integer) therefore, xy+1 => (3*a+1)*y+1
Since 3*a*y is divisible by 3, we have to find out whether (y+1) is divisible by 3.
Statement 2: When y is divided by 9, the remainder is 8. Clearly insufficient, since we don't know the value of x. But, we can say that y => 9*b+8 ( where b is an integer)
Combining 1) and 2), we can say y+1 = 9*b + 9 is divisible by 3. Hence the answer should be C
Re: If x and y are integers, is xy + 1 divisible by 3?
[#permalink]
Show Tags
09 Dec 2014, 20:22
2
Question: remainder of (x*y +1)? (1) Not sufficient. Just tells that x could be equal to 4, 10, 13,.... but nothing about y. (2) Not sufficient. Just tell that y could be 17, 26, 35,...but no information about x.
(1)+(2) Sufficient. If x=10, y=26, then (10*26 + 1) = 261 ----->which is divisible by 3, so the remainder is 0 If x=4, y=35, then (4*35 + 1) = 141 ----> divisible by 3, so the remainder equals 0
Re: If x and y are integers, is xy + 1 divisible by 3?
[#permalink]
Show Tags
10 Dec 2014, 01:11
3
If x and y are integers, is xy + 1 divisible by 3?
(1) When x is divided by 3, the remainder is 1. (2) When y is divided by 9, the remainder is 8.
Statement 1 x = 3m+1; m is an integer no information on y, hence insufficient.
Statement 2 y= 9n +8; n is an integer no information on x, hence insufficient.
Combining statements (1) and (2) and substituting x and y as (3m+1) and (9n+8) xy +1 = (3m+1)(9n+8)+1 = 27mn+24m+9n+9 = 3*(9mn+8m+3n+3) --> xy+1 is divisible by 3 Hence, both statements together are sufficient
Re: If x and y are integers, is xy + 1 divisible by 3?
[#permalink]
Show Tags
09 Dec 2018, 10:15
My approach: Stem: If x and y are integers, is xy + 1 divisible by 3? –> notice that xy+1 is divisible by three if xy is even (but not iff it is even)
(1) When x is divided by 3, the remainder is 1. x=3q+1 –> not divisible by 3 –> y could be divisible by 3 or it could not be, producing two different answers –> Hence, NOT SUFFICIENT
(2) When y is divided by 9, the remainder is 8. –>Hence, the remainder when divided by 3 is also 8 –>However, x could be divisible by 3 or it could not be, producing two different answers –>Hence, NOT SUFFICIENT
(1) & (2) together —>From 1, we know that remainder is 1 —>From 2, we know that remainder is 8 —>Iff the remainder product of xy and the sum of the remainder product of xy and 1 add to 3, xy+1 must be divisible
HENCE, (remainder x) * (remainder y) + (1) = 8*1+1= 9, hence, xy+1 is always divisible by 3: C
gmatclubot
Re: If x and y are integers, is xy + 1 divisible by 3? &nbs
[#permalink]
09 Dec 2018, 10:15
close
75% (01:19) correct 
