simple annoying problem

This topic has expert replies
Junior | Next Rank: 30 Posts
Posts: 13
Joined: Tue Jun 05, 2007 1:29 pm

simple annoying problem

by dzelkas » Thu Jun 05, 2008 5:20 pm
If y(u - c) = 0 and j(u - k) = 0, which of the following must be true, assuming c < k?

Can someone please help explain how we get this answer?

yj <0> 0
yj = 0
j = 0
y = 0

Master | Next Rank: 500 Posts
Posts: 438
Joined: Mon Feb 12, 2007 9:44 am
Thanked: 26 times

by chidcguy » Thu Jun 05, 2008 7:30 pm
y(u - c) = 0

means either y=0 or u-c=0 => u=c

and j(u - k) = 0,

similarly j=0 or u=k

If you combine both u=c=k.

Now why is the question saying assume c<k? Am I missing something?

Legendary Member
Posts: 631
Joined: Mon Feb 18, 2008 11:57 pm
Thanked: 29 times
Followed by:3 members

by netigen » Thu Jun 05, 2008 8:52 pm
lol chidcguy :)

Multiply the 2 equations y(u - c) = 0 and j(u - k) = 0

to get yj (u - c) (u - k) = 0

we know that c<k so the above is only possible when yj = 0

Master | Next Rank: 500 Posts
Posts: 438
Joined: Mon Feb 12, 2007 9:44 am
Thanked: 26 times

by chidcguy » Thu Jun 05, 2008 8:55 pm
Thanks NG. Thats what I initially did, but lost direction before I completed my thought and ran in the other route.

I should have seen that c<k condition essentially avoids the c=k situation

Thanks again.

Master | Next Rank: 500 Posts
Posts: 178
Joined: Wed May 14, 2008 3:51 pm
Thanked: 16 times
Followed by:1 members
GMAT Score:99%+

by egybs » Fri Jun 06, 2008 4:05 pm
That's not correct... the multiplied out equation is not sufficient to determine the answer... For example, from the multiplied equation, you could have something like:
y=1, j=2, u=3, c=3, k=4 and that would work without yj being equal to 0.


The answer is jy=0 though...

I just looked at the three equations (including c<k) and saw that one of the following two things had to happen:

Either [(u=c and j=0) or (u=k and y=0)] or (j=0 or y=0)

No matter which is the case, there's always a requirement for either j=0 or y=0. So we know that jy has to equal 0.
netigen wrote:to get yj (u - c) (u - k) = 0

we know that c<k so the above is only possible when yj = 0

Legendary Member
Posts: 631
Joined: Mon Feb 18, 2008 11:57 pm
Thanked: 29 times
Followed by:3 members

by netigen » Fri Jun 06, 2008 5:53 pm
Your reasoning is not correct. The question provides two conditions

y(u - c) = 0 and j(u - k) = 0

The case you quoted y=1, j=2, u=3, c=3, k=4 does not hold good and hence is not even a valid scenario for this question.

Your reasoning will only hold if you can show numbers that fulfill the conditions of the question and still do not hold true for the the case that I reasoned.
egybs wrote:That's not correct... the multiplied out equation is not sufficient to determine the answer... For example, from the multiplied equation, you could have something like:
y=1, j=2, u=3, c=3, k=4 and that would work without yj being equal to 0.


The answer is jy=0 though...

I just looked at the three equations (including c<k) and saw that one of the following two things had to happen:

Either [(u=c and j=0) or (u=k and y=0)] or (j=0 or y=0)

No matter which is the case, there's always a requirement for either j=0 or y=0. So we know that jy has to equal 0.
netigen wrote:to get yj (u - c) (u - k) = 0

we know that c<k so the above is only possible when yj = 0

Master | Next Rank: 500 Posts
Posts: 178
Joined: Wed May 14, 2008 3:51 pm
Thanked: 16 times
Followed by:1 members
GMAT Score:99%+

by egybs » Fri Jun 06, 2008 5:58 pm
dude, reread what I wrote. You implied that simply looking at the multiplied out equation was enough to come to the conclusion that jy=0, while it isn't. You need to consider the other two equations. The example values I gave were sufficient to satisfy the multiplied out equation you provided, but were not sufficient for the original two equations.... which was the entire point!!


netigen wrote:Your reasoning is not correct. The question provides two conditions

y(u - c) = 0 and j(u - k) = 0

The case you quoted y=1, j=2, u=3, c=3, k=4 does not hold good and hence is not even a valid scenario for this question.

Your reasoning will only hold if you can show numbers that fulfill the conditions of the question and still do not hold true for the the case that I reasoned.
egybs wrote:That's not correct... the multiplied out equation is not sufficient to determine the answer... For example, from the multiplied equation, you could have something like:
y=1, j=2, u=3, c=3, k=4 and that would work without yj being equal to 0.


The answer is jy=0 though...

I just looked at the three equations (including c<k) and saw that one of the following two things had to happen:

Either [(u=c and j=0) or (u=k and y=0)] or (j=0 or y=0)

No matter which is the case, there's always a requirement for either j=0 or y=0. So we know that jy has to equal 0.
netigen wrote:to get yj (u - c) (u - k) = 0

we know that c<k so the above is only possible when yj = 0

Legendary Member
Posts: 631
Joined: Mon Feb 18, 2008 11:57 pm
Thanked: 29 times
Followed by:3 members

by netigen » Fri Jun 06, 2008 6:07 pm
Whatever i said has to be taken in the context of the question as it was not a general statement.

According to the question 'u' can not be equal to c or k, unless c=k which we know does not hold according to the question.

Hence, the only possibility in the one that I quoted. If you still don't get it get a Maths refresher.

Master | Next Rank: 500 Posts
Posts: 178
Joined: Wed May 14, 2008 3:51 pm
Thanked: 16 times
Followed by:1 members
GMAT Score:99%+

by egybs » Fri Jun 06, 2008 6:12 pm
Whatever man - i have no interest in arguing... but if you don't get what I wrote, you should probably take a english refresher.

netigen wrote:Whatever i said has to be taken in the context of the question as it was not a general statement.

According to the question 'u' can not be equal to c or k, unless c=k which we know does not hold according to the question.

Hence, the only possibility in the one that I quoted. If you still don't get it get a Maths refresher.

Master | Next Rank: 500 Posts
Posts: 101
Joined: Tue May 27, 2008 6:03 am
Thanked: 5 times

by gmatinjuly » Mon Jun 09, 2008 5:02 am
This is my reasoning please let me know if I am missing anything.

Here a * b = 0
So either a = 0 or b = 0

In our case

y(u - c) = 0
implies either y = 0 or u-c = 0

Again j(u - k) = 0
implies either j = 0 or u-k = 0

Now as c> k , their value is different and two different values CAN NOT be subtracted from a constant value to get the same result i.e. 0.

Hence y /j has to be 0


Other assumption is if say one of them c or k si equal to u ...in that case either y will be 0 or j will be 0

so in each case yj will always be 0.

Master | Next Rank: 500 Posts
Posts: 178
Joined: Wed May 14, 2008 3:51 pm
Thanked: 16 times
Followed by:1 members
GMAT Score:99%+

by egybs » Mon Jun 09, 2008 9:28 am
Looks good to me!
gmatinjuly wrote:This is my reasoning please let me know if I am missing anything.

Here a * b = 0
So either a = 0 or b = 0

In our case

y(u - c) = 0
implies either y = 0 or u-c = 0

Again j(u - k) = 0
implies either j = 0 or u-k = 0

Now as c> k , their value is different and two different values CAN NOT be subtracted from a constant value to get the same result i.e. 0.

Hence y /j has to be 0


Other assumption is if say one of them c or k si equal to u ...in that case either y will be 0 or j will be 0

so in each case yj will always be 0.