NEW HERE? LEARN MORE
closeclose
Last visit was: 24 Apr 2024, 14:31 It is currently 24 Apr 2024, 14:31
Decision Tracker
My Rewards
New posts
New comers' posts

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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel

If x, y, and d are integers and d is odd, are both x and y divisible

SORT BY:
Date
Kudos
Tags:
Find Similar Topics 
Show Tags
Hide Tags
User avatar
eybrj2
Manager
Manager
Joined: 31 Oct 2011
Posts: 201
Own Kudos [?]: 7797 [181]
Given Kudos: 18
Send PM
If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   02 Mar 2012, 10:36
14
Kudos
166
Bookmarks
00:00
A
B
C
D
E

Difficulty:

55% (hard)

Question Stats:

65% (02:04) correct 35% (01:54) wrong based on 2273 sessions
Hide Show timer Statistics
If x, y, and d are integers and d is odd, are both x and y divisible by d ?

(1) x + y is divisible by d.
(2) x − y is divisible by d.


DS44402.01
ShowHide Answer
Official Answer
C
Most Helpful Reply
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 92900
Own Kudos [?]: 618804 [87]
Given Kudos: 81588
Send PM
CAT Tests Forum Quiz Mode
If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   02 Mar 2012, 11:04
31
Kudos
54
Bookmarks
Expert Reply
If x, y and d are integers and d is odd, are both x and y divisible by d?

Question asks whether both x and y are multiples of d.

(1) x+y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=2\), \(y=4\) and \(d=3\) then the answer is NO. Not sufficient.

(2) x-y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=4\), \(y=1\) and \(d=3\) then the answer is NO. Not sufficient.

(1)+(2) From (1) \(x+y=dq\) and from (2) \(x-y=dp\) --> sum those two equations: \(2x=d(q+p)\) --> \(x=\frac{d(q+p)}{2}\). Now, since \(x\) is an integer and \(d\) is an odd number then \(\frac{q+p}{2}=integer\) (d/2 cannot be an integer because d is odd) --> \(x=d*integer\) --> \(x\) is a multiple of \(d\). From (1) {multiple of d}+y={multiple of d} --> hence \(y\) must also be a multiple of \(d\). Sufficient.

Answer: C.

Below might help to understand this concept better.

If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\) and \(b=9\), both divisible by 3 ---> \(a+b=15\) and \(a-b=-3\), again both divisible by 3.

If out of integers \(a\) and \(b\) one is a multiple of some integer \(k>1\) and another is not, then their sum and difference will NOT be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\), divisible by 3 and \(b=5\), not divisible by 3 ---> \(a+b=11\) and \(a-b=1\), neither is divisible by 3.

If integers \(a\) and \(b\) both are NOT multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference may or may not be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=5\) and \(b=4\), neither is divisible by 3 ---> \(a+b=9\), is divisible by 3 and \(a-b=1\), is not divisible by 3;
OR: \(a=6\) and \(b=3\), neither is divisible by 5 ---> \(a+b=9\) and \(a-b=3\), neither is divisible by 5;
OR: \(a=2\) and \(b=2\), neither is divisible by 4 ---> \(a+b=4\) and \(a-b=0\), both are divisible by 4.

Hope it's clear.
General Discussion
User avatar
B
AbeinOhio
Manager
Manager
Joined: 22 Feb 2012
Posts: 74
Own Kudos [?]: 67 [1]
Given Kudos: 25
Schools: HBS '16
GMAT 1: 670 Q42 V40
GMAT 2: 740 Q49 V42
GPA: 3.47
WE:Corporate Finance (Aerospace and Defense)
Send PM
GMAT ToolKit User
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   02 Mar 2012, 11:22
1
Kudos
Nice explanation Bunuel - i got it down to C & E and made an educated guess because I couldnt get any example to not work given both conditions..

the part of your explanation that took me a few reads to understand was the

x = D(Q+p)/2 and since d is an odd number (Q+P)/2 must be an integer..
Then i realized since D is odd it couldnt cancel out the 2 below the line to get x to equal an integer..
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 92900
Own Kudos [?]: 618804 [0]
Given Kudos: 81588
Send PM
CAT Tests Forum Quiz Mode
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   02 Mar 2012, 11:27
Expert Reply
AbeinOhio wrote:
Nice explanation Bunuel - i got it down to C & E and made an educated guess because I couldnt get any example to not work given both conditions..

the part of your explanation that took me a few reads to understand was the

x = D(Q+p)/2 and since d is an odd number (Q+P)/2 must be an integer..
Then i realized since D is odd it couldnt cancel out the 2 below the line to get x to equal an integer..


Making an educated guess for C, based on number plugging is not a bad idea at all, especially if you are running out of time and cannot prove C with 100% certainty.
User avatar
B
mau5
Verbal Forum Moderator
Joined: 10 Oct 2012
Posts: 485
Own Kudos [?]: 3092 [4]
Given Kudos: 141
Send PM
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   27 May 2013, 07:07
2
Kudos
2
Bookmarks
eybrj2 wrote:
If x, y and d are integers and d is odd, are both x and y divisible by d?

(1) x+y is divisible by d.

(2) x-y is divisible by d.


Just a numerical plugin-in approach:

From F.S 1, we know that (x+y) is divisible by d. Take x = 5,y = 4,d=3. We get a NO for the question stem.
Again, take x=9,y=3,d=3. We get a YES for the question stem.Insufficient.

From F.S2, just as above, take x=7,y=4,d=3. We get a NO for the question stem.
Again, take x=9,y=6,d=3. We get a YES. Insufficient.

Both taken together, we know that (x+y) = d*m, where m is some integer.
Also , (x-y) = d*n, n is an integer.

Thus, adding we get 2x = d*(m+n). Now, as the LHS is,the RHS has to be even. Also, d is odd. Thus, (m+n) = even --> (m+n) = 2k--> x = d*k and \(\frac{x}{d} = k\)(some integer),now if (x+y) is divisible by d, and x alone is divisible by x, then y has to be divisible by d. Sufficient.

C.
avatar
B
bankerboy30
Manager
Manager
Joined: 27 May 2014
Posts: 72
Own Kudos [?]: 44 [0]
Given Kudos: 21
Send PM
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   06 Jul 2014, 21:13
Do we ignore zero? If say d= 3 and x and y are 3,0 respectively wouldn't the answer be E?
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 92900
Own Kudos [?]: 618804 [2]
Given Kudos: 81588
Send PM
CAT Tests Forum Quiz Mode
If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   07 Jul 2014, 01:01
1
Kudos
1
Bookmarks
Expert Reply
bankerboy30 wrote:
Do we ignore zero? If say d= 3 and x and y are 3,0 respectively wouldn't the answer be E?


0 is divisible by EVERY integer except 0 itself.

Check for more here: https://gmatclub.com/forum/tips-and-hint ... 72096.html

Hope it helps.
User avatar
P
mvictor
Board of Directors
Joined: 17 Jul 2014
Posts: 2163
Own Kudos [?]: 1180 [4]
Given Kudos: 236
Location: United States (IL)
Concentration: Finance, Economics
Schools: Stanford '20 (WD)
GMAT 1: 650 Q49 V30
GPA: 3.92
WE:General Management (Transportation)
Send PM
GMAT ToolKit User Reviews Badge
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   06 Dec 2016, 15:37
4
Kudos
eybrj2 wrote:
If x, y and d are integers and d is odd, are both x and y divisible by d?

(1) x+y is divisible by d.

(2) x-y is divisible by d.


my answer is C too...

1. suppose d=3
x=2, y=1. x+y divisible by 3
x=5, y=1. x+y divisible by 3
one case works, another not.

2. x-y divisible by d
suppose d=3
x=5, y=2 -> 5-2 = 3, divisible
x=6, y=3 -> 6-3 = 3, divisible
one option works, another not.

1+2
since both of them are divisible by 3, sum of x+y and x-y must be divisible by 3
so will the difference between them

x+y+x+y = 2x -> divisible by d. since d is odd, x will 100% be divisible by 3.
x+y-x+y = 2y -> same thing. y is divisible by 3.

answer is C.
avatar
B
babloorudra
Intern
Intern
Joined: 26 Jun 2019
Posts: 13
Own Kudos [?]: 5 [0]
Given Kudos: 9
Send PM
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   27 May 2020, 20:19
Bunuel wrote:
If x, y and d are integers and d is odd, are both x and y divisible by d?

Question asks whether both x and y are multiples of d.

(1) x+y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=2\), \(y=4\) and \(d=3\) then the answer is NO. Not sufficient.

(2) x-y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=4\), \(y=1\) and \(d=3\) then the answer is NO. Not sufficient.

(1)+(2) From (1) \(x+y=dq\) and from (2) \(x-y=dp\) --> sum those two equations: \(2x=d(q+p)\) --> \(x=\frac{d(q+p)}{2}\). Now, since \(x\) is an integer and \(d\) is an odd number then \(\frac{q+p}{2}=integer\) (d/2 can not be an integer because d is odd) --> \(x=d*integer\) --> \(x\) is a multiple of \(d\). From (1) {multiple of d}+y={multiple of d} --> hence \(y\) must also be a multiple of \(d\). Sufficient.

Answer: C.

Below might help to understand this concept better.

If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\) and \(b=9\), both divisible by 3 ---> \(a+b=15\) and \(a-b=-3\), again both divisible by 3.

If out of integers \(a\) and \(b\) one is a multiple of some integer \(k>1\) and another is not, then their sum and difference will NOT be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\), divisible by 3 and \(b=5\), not divisible by 3 ---> \(a+b=11\) and \(a-b=1\), neither is divisible by 3.

If integers \(a\) and \(b\) both are NOT multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference may or may not be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=5\) and \(b=4\), neither is divisible by 3 ---> \(a+b=9\), is divisible by 3 and \(a-b=1\), is not divisible by 3;
OR: \(a=6\) and \(b=3\), neither is divisible by 5 ---> \(a+b=9\) and \(a-b=3\), neither is divisible by 5;
OR: \(a=2\) and \(b=2\), neither is divisible by 4 ---> \(a+b=4\) and \(a-b=0\), both are divisible by 4.

Hope it's clear.



Hello Buenel, With respect to the Concept, Is the reverse of 1 also true? ie., if the sum and difference of x and y is divisible by D, then X and Y are separately divisible by D?
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 92900
Own Kudos [?]: 618804 [0]
Given Kudos: 81588
Send PM
CAT Tests Forum Quiz Mode
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   28 May 2020, 00:55
Expert Reply
babloorudra wrote:
Bunuel wrote:
If x, y and d are integers and d is odd, are both x and y divisible by d?

Question asks whether both x and y are multiples of d.

(1) x+y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=2\), \(y=4\) and \(d=3\) then the answer is NO. Not sufficient.

(2) x-y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=4\), \(y=1\) and \(d=3\) then the answer is NO. Not sufficient.

(1)+(2) From (1) \(x+y=dq\) and from (2) \(x-y=dp\) --> sum those two equations: \(2x=d(q+p)\) --> \(x=\frac{d(q+p)}{2}\). Now, since \(x\) is an integer and \(d\) is an odd number then \(\frac{q+p}{2}=integer\) (d/2 can not be an integer because d is odd) --> \(x=d*integer\) --> \(x\) is a multiple of \(d\). From (1) {multiple of d}+y={multiple of d} --> hence \(y\) must also be a multiple of \(d\). Sufficient.

Answer: C.

Below might help to understand this concept better.

If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\) and \(b=9\), both divisible by 3 ---> \(a+b=15\) and \(a-b=-3\), again both divisible by 3.

If out of integers \(a\) and \(b\) one is a multiple of some integer \(k>1\) and another is not, then their sum and difference will NOT be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\), divisible by 3 and \(b=5\), not divisible by 3 ---> \(a+b=11\) and \(a-b=1\), neither is divisible by 3.

If integers \(a\) and \(b\) both are NOT multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference may or may not be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=5\) and \(b=4\), neither is divisible by 3 ---> \(a+b=9\), is divisible by 3 and \(a-b=1\), is not divisible by 3;
OR: \(a=6\) and \(b=3\), neither is divisible by 5 ---> \(a+b=9\) and \(a-b=3\), neither is divisible by 5;
OR: \(a=2\) and \(b=2\), neither is divisible by 4 ---> \(a+b=4\) and \(a-b=0\), both are divisible by 4.

Hope it's clear.



Hello Buenel, With respect to the Concept, Is the reverse of 1 also true? ie., if the sum and difference of x and y is divisible by D, then X and Y are separately divisible by D?


No. For example, 5 + 1 = 6 is divisible by 3 but neither 5 nor 1 is.
User avatar
S
hemantbafna
Manager
Manager
Joined: 30 Jan 2020
Posts: 167
Own Kudos [?]: 79 [0]
Given Kudos: 528
Location: India
WE:Accounting (Accounting)
Send PM
GMAT ToolKit User
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   07 Aug 2020, 04:09
Bunuel wrote:

Below might help to understand this concept better.

If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\) and \(b=9\), both divisible by 3 ---> \(a+b=15\) and \(a-b=-3\), again both divisible by 3.

If out of integers \(a\) and \(b\) one is a multiple of some integer \(k>1\) and another is not, then their sum and difference will NOT be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\), divisible by 3 and \(b=5\), not divisible by 3 ---> \(a+b=11\) and \(a-b=1\), neither is divisible by 3.

If integers \(a\) and \(b\) both are NOT multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference may or may not be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=5\) and \(b=4\), neither is divisible by 3 ---> \(a+b=9\), is divisible by 3 and \(a-b=1\), is not divisible by 3;
OR: \(a=6\) and \(b=3\), neither is divisible by 5 ---> \(a+b=9\) and \(a-b=3\), neither is divisible by 5;
OR: \(a=2\) and \(b=2\), neither is divisible by 4 ---> \(a+b=4\) and \(a-b=0\), both are divisible by 4.

Hope it's clear.



Thank you for the explanation, helps in understanding.
Especially If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):.

Can easily jump to answer choice C with the explanation.
User avatar
L
nick1816
Retired Moderator
Joined: 19 Oct 2018
Posts: 1878
Own Kudos [?]: 6296 [1]
Given Kudos: 704
Location: India
Send PM
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   25 Aug 2020, 12:26
1
Kudos
Genoa2000
If A->B is true, but !A doesn't implies !B, if d is even.

If d is even, OA will be E.

There are 2 possibilities when d is even.

1) when a or b is divided by d, remainder is d/2.
2) when a or b is divided by d, remainder is 0.

in both cases, a+b and a-b are divisible by d.
User avatar
L
KarishmaB
Tutor
Joined: 16 Oct 2010
Posts: 14817
Own Kudos [?]: 64899 [0]
Given Kudos: 426
Location: Pune, India
Send PM
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   27 Aug 2020, 23:35
Expert Reply
Genoa2000 wrote:
hemantbafna wrote:
Bunuel wrote:

Below might help to understand this concept better.

If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\) and \(b=9\), both divisible by 3 ---> \(a+b=15\) and \(a-b=-3\), again both divisible by 3.

If out of integers \(a\) and \(b\) one is a multiple of some integer \(k>1\) and another is not, then their sum and difference will NOT be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\), divisible by 3 and \(b=5\), not divisible by 3 ---> \(a+b=11\) and \(a-b=1\), neither is divisible by 3.

If integers \(a\) and \(b\) both are NOT multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference may or may not be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=5\) and \(b=4\), neither is divisible by 3 ---> \(a+b=9\), is divisible by 3 and \(a-b=1\), is not divisible by 3;
OR: \(a=6\) and \(b=3\), neither is divisible by 5 ---> \(a+b=9\) and \(a-b=3\), neither is divisible by 5;
OR: \(a=2\) and \(b=2\), neither is divisible by 4 ---> \(a+b=4\) and \(a-b=0\), both are divisible by 4.

Hope it's clear.



Thank you for the explanation, helps in understanding.
Especially If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):.

Can easily jump to answer choice C with the explanation.


That's true!

What scared me to think in that way was assuming that if A -> B also B -> A. In this situation we have an A <-> B relationship in the rule. Am I right Bunuel VeritasKarishma nick1816?

Can we also state the reverse for this rule?


Yes, you need to be wary of this. Just because A -> B, it doesn't mean B -> A.

Check this link first: https://www.gmatclub.com/forum/veritas-prep-resource-links-no-longer-available-399979.html#/2011/0 ... unraveled/

Now think in terms of groups of d marbles.
If x is made up of some groups (say 5 grps) of d marbles, and y is made up of some groups (say 7 grps) of d marbles, when you put them together (x + y), you will still get groups (12 grps) of d marbles.
Also, their difference would be a few groups (2 groups) of d marbles too.

Now think of what happens when the sum and difference is in groups of d marbles. Does it mean x and y need to have complete groups of d marbles too?
Say you have total 12 grps of d marbles in x + y and 2 grps of d marbles. The rest of the 10 grps can be equally split into x and y with 5 grps each so x and y will be divisible by d.

But think what happens if you have 12 grps of d marbles in the sum and 3 grps of d marbles as the difference. Then you are left with 9 grps which need to be equally split between x and y. If d is odd you cannot do it but if d is even, you can still split them equally by breaking the grps. Then x and y will not be individually divisible by d.
User avatar
G
Basshead
Director
Director
Joined: 09 Jan 2020
Posts: 966
Own Kudos [?]: 223 [0]
Given Kudos: 434
Location: United States
Send PM
If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   14 Nov 2020, 05:58
If x, y, and d are integers and d is odd, are both x and y divisible by d ?

Rephrased: Is x a multiple of d? Is y a multiple of d?

(1) \(x + y\) is divisible by d.

let \(d = 3, x = 3, y = 0\) -- YES

let \(d = 3, x = 2, y = 1\) -- NO

INSUFFICIENT.

(2) x − y is divisible by d.

let \(d = 3, x = 3, y = 0\) -- YES

let \(d = 3, x = 4, y = 1 \)-- NO

INSUFFICIENT.

(1&2) x + y is divisible by d; x - y is divisible by d:

let \(d = 3, x = 3, y = 0\) -- YES

Answer is C.
avatar
S
A2208
Intern
Intern
Joined: 23 Apr 2019
Posts: 34
Own Kudos [?]: 49 [1]
Given Kudos: 48
Concentration: Entrepreneurship, Marketing
Schools: Kellogg '24 (WL) Haas '24 (WL)
GMAT 1: 750 Q49 V44
Send PM
Reviews Badge
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   27 Nov 2020, 06:28
1
Kudos
Bunuel wrote:
If x, y and d are integers and d is odd, are both x and y divisible by d?

Question asks whether both x and y are multiples of d.

(1) x+y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=2\), \(y=4\) and \(d=3\) then the answer is NO. Not sufficient.

(2) x-y is divisible by d --> if \(x=y=d=1\) then the answer is YES but if \(x=4\), \(y=1\) and \(d=3\) then the answer is NO. Not sufficient.

(1)+(2) From (1) \(x+y=dq\) and from (2) \(x-y=dp\) --> sum those two equations: \(2x=d(q+p)\) --> \(x=\frac{d(q+p)}{2}\). Now, since \(x\) is an integer and \(d\) is an odd number then \(\frac{q+p}{2}=integer\) (d/2 can not be an integer because d is odd) --> \(x=d*integer\) --> \(x\) is a multiple of \(d\). From (1) {multiple of d}+y={multiple of d} --> hence \(y\) must also be a multiple of \(d\). Sufficient.

Answer: C.

Below might help to understand this concept better.

If integers \(a\) and \(b\) are both multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference will also be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\) and \(b=9\), both divisible by 3 ---> \(a+b=15\) and \(a-b=-3\), again both divisible by 3.

If out of integers \(a\) and \(b\) one is a multiple of some integer \(k>1\) and another is not, then their sum and difference will NOT be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=6\), divisible by 3 and \(b=5\), not divisible by 3 ---> \(a+b=11\) and \(a-b=1\), neither is divisible by 3.

If integers \(a\) and \(b\) both are NOT multiples of some integer \(k>1\) (divisible by \(k\)), then their sum and difference may or may not be a multiple of \(k\) (divisible by \(k\)):
Example: \(a=5\) and \(b=4\), neither is divisible by 3 ---> \(a+b=9\), is divisible by 3 and \(a-b=1\), is not divisible by 3;
OR: \(a=6\) and \(b=3\), neither is divisible by 5 ---> \(a+b=9\) and \(a-b=3\), neither is divisible by 5;
OR: \(a=2\) and \(b=2\), neither is divisible by 4 ---> \(a+b=4\) and \(a-b=0\), both are divisible by 4.

Hope it's clear.


Very clear and foolproof approach! Thanks Bunuel
User avatar
B
dylanl1218
Current Student
Joined: 20 Oct 2018
Posts: 43
Own Kudos [?]: 9 [0]
Given Kudos: 247
Location: United States
Schools: Johnson '24 (A)
GPA: 3.5
Send PM
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   07 Jun 2021, 10:14
eybrj2 wrote:
If x, y, and d are integers and d is odd, are both x and y divisible by d ?

(1) x + y is divisible by d.
(2) x − y is divisible by d.


DS44402.01


Statement 1:
This provides that (x+y)/d = k in which k is some integer. This alone is not sufficient.

Statement 2:
This provides that (x-y)/d = q in which q is some integer. Similar to statement one, this alone is not suffecient.

(1) and (2) together:
Let's start by manipulating the equation in statement 1 to find the value of x in terms of d and k. So x = KD - y. Now let's plug x into the equation created in statement two. So ((kd - y) - y)/d = q. Since q is an integer it must be the case that d divides into (kd-y) and y, which are x and y respectively. Both statements are suffecient.
User avatar
D
GMATGuruNY
Tutor
Joined: 04 Aug 2010
Posts: 1315
Own Kudos [?]: 3136 [0]
Given Kudos: 9
Schools:Dartmouth College
Send PM
If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   07 Jun 2021, 12:48
Expert Reply
eybrj2 wrote:
If x, y, and d are integers and d is odd, are both x and y divisible by d ?

(1) x + y is divisible by d.
(2) x − y is divisible by d.


Are x and y both divisible by d?

If d=1, the answer to the question stem is YES, since every integer is divisible by 1.
The only question is whether the answer to the question stem can be NO.

Statement 1:
Case 1: d=3, x=1 and y=2
In this case, x and y are NOT divisible by d, so the answer to the question stem is NO.
Since the answer can be YES (if d=1) or NO (as in Case 1), INSUFFICIENT.

Statement 2:
Case 2: d=3, x=4 and y=1
In this case, x and y are NOT divisible by d, so the answer to the question stem is NO.
Since the answer can be YES (if d=1) or NO (as in Case 2), INSUFFICIENT.

Statements combined:
Let d=3.
Implication:
x+y is a multiple of 3, with the result that x+y = 3, 6, 9, 12, 15, 18, 21...
x-y is a multiple of 3, with the result that x-y = 3, 6, 9, 12, 15, 18, 21...

Since the sum of x+y and x-y is equal to 2x, the sum of x+y and x-y must be EVEN.

Case 3: x+y=3 and x-y=3, implying that x=3 and y=0
In this case, both x and y are divisible by d=3.
Case 4: x+y=12 and x-y=6, implying that x=9 and y=3
In this case, both x and y are divisible by d=3.
Case 5: x+y=21 and x-y=9, implying that x=15 and y=6
In this case, both x and y are divisible by d=3.

In every case, x and y are both divisible by d.
Implication:
The answer to the question stem is YES.
SUFFICIENT.

Show Spoiler
C
User avatar
bumpbot
Non-Human User
Joined: 09 Sep 2013
Posts: 32655
Own Kudos [?]: 821 [0]
Given Kudos: 0
Send PM
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink] New post   10 Apr 2024, 17:08
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
GMAT Club Bot
gmatclubot
Re: If x, y, and d are integers and d is odd, are both x and y divisible [#permalink]
10 Apr 2024, 17:08
Moderator:
Bunuel
Math Expert
92902 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne
Main navigation
GMAT Resources
Partners
MBA Resources
www.gmac.com|www.mba.com | | GMAT Club Rules | Terms and Conditions