This problem has been recently posted by halle i believe, I : DS Archive
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 20 Jan 2017, 00:44

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# This problem has been recently posted by halle i believe, I

Author Message
Senior Manager
Joined: 07 Oct 2003
Posts: 353
Location: Manhattan
Followers: 2

Kudos [?]: 20 [0], given: 0

This problem has been recently posted by halle i believe, I [#permalink]

### Show Tags

26 Jun 2004, 17:33
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

This problem has been recently posted by halle i believe, I couldn't trace the orginal post, so I'm reposting it in effort to clarify an issue:

[x]>=[x-y]+[y], is y>x?

1. x>0
2. y>0

Senior Manager
Joined: 21 Mar 2004
Posts: 444
Location: Cary,NC
Followers: 3

Kudos [?]: 68 [0], given: 0

### Show Tags

27 Jun 2004, 22:56
Is this a greatest integer function problem or a mod problem ?

for mod problems I would just take appropriate values and use. However not all times we can use only values.......we might have to use a trick here and there.

- let me know b4 i can give it a try

- ash
_________________

ash
________________________
I'm crossing the bridge.........

Manager
Joined: 07 May 2004
Posts: 183
Location: Ukraine, Russia(part-time)
Followers: 2

Kudos [?]: 15 [0], given: 0

### Show Tags

27 Jun 2004, 23:15
lastochka wrote:
This problem has been recently posted by halle i believe, I couldn't trace the orginal post, so I'm reposting it in effort to clarify an issue:

[x]>=[x-y]+[y], is y>x?

1. x>0
2. y>0

From |x| >= |x-y| + |y| we get that |x| = |x-y| + |y|, because actually for every x and y it is true that |x| <= |x-y| + |y|(this can be proven...)!

Then x, y, and x - y have the same sign (from =).

1 is sufficient: if x > 0, then x - y >= 0, then y < x is not true.

2 is sufficient too because the same is true for x - y >= 0.

C.
Manager
Joined: 07 May 2004
Posts: 183
Location: Ukraine, Russia(part-time)
Followers: 2

Kudos [?]: 15 [0], given: 0

### Show Tags

27 Jun 2004, 23:22
You may ask, why from |x| = |x-y| + |y| => x, x-y and y have the same sign?

It follows from:

(|x|-|y|)^2 = |x-y|^2 => -2*|x|*|y| = -2*x*y => x*y >= 0. And if x > 0, then y >= 0.

etc.
Senior Manager
Joined: 07 Oct 2003
Posts: 353
Location: Manhattan
Followers: 2

Kudos [?]: 20 [0], given: 0

### Show Tags

28 Jun 2004, 05:31
Emmanuel wrote:
lastochka wrote:
This problem has been recently posted by halle i believe, I couldn't trace the orginal post, so I'm reposting it in effort to clarify an issue:

[x]>=[x-y]+[y], is y>x?

1. x>0
2. y>0

From |x| >= |x-y| + |y| we get that |x| = |x-y| + |y|, because actually for every x and y it is true that |x| <= |x-y| + |y|(this can be proven...)!

Then x, y, and x - y have the same sign (from =).

1 is sufficient: if x > 0, then x - y >= 0, then y < x is not true.

2 is sufficient too because the same is true for x - y >= 0.

C.

since both are sufficient you mean the answer is D
other than that, I agree with your solution
Senior Manager
Joined: 07 Oct 2003
Posts: 353
Location: Manhattan
Followers: 2

Kudos [?]: 20 [0], given: 0

### Show Tags

28 Jun 2004, 05:33
ashkg wrote:
Is this a greatest integer function problem or a mod problem ?

for mod problems I would just take appropriate values and use. However not all times we can use only values.......we might have to use a trick here and there.

- let me know b4 i can give it a try

- ash

not sure I understand the difference in your question ash. This is an absolute values problem.
Manager
Joined: 07 May 2004
Posts: 183
Location: Ukraine, Russia(part-time)
Followers: 2

Kudos [?]: 15 [0], given: 0

### Show Tags

28 Jun 2004, 05:39
lastochka wrote:
Emmanuel wrote:
lastochka wrote:
This problem has been recently posted by halle i believe, I couldn't trace the orginal post, so I'm reposting it in effort to clarify an issue:

[x]>=[x-y]+[y], is y>x?

1. x>0
2. y>0

From |x| >= |x-y| + |y| we get that |x| = |x-y| + |y|, because actually for every x and y it is true that |x| <= |x-y| + |y|(this can be proven...)!

Then x, y, and x - y have the same sign (from =).

1 is sufficient: if x > 0, then x - y >= 0, then y < x is not true.

2 is sufficient too because the same is true for x - y >= 0.

C.

since both are sufficient you mean the answer is D
other than that, I agree with your solution

Yes, lastochka, I don't remember exact definitions for A,B,C,D,E, but I know the solution...
Manager
Joined: 07 May 2004
Posts: 183
Location: Ukraine, Russia(part-time)
Followers: 2

Kudos [?]: 15 [0], given: 0

### Show Tags

28 Jun 2004, 05:40
lastochka wrote:
not sure I understand the difference in your question ash. This is an absolute values problem.

lastochka, ashkg want to say that [x] nay mean greatest integer, which is less than x.
Senior Manager
Joined: 21 Mar 2004
Posts: 444
Location: Cary,NC
Followers: 3

Kudos [?]: 68 [0], given: 0

### Show Tags

28 Jun 2004, 08:42
lastochka wrote:
ashkg wrote:
Is this a greatest integer function problem or a mod problem ?

for mod problems I would just take appropriate values and use. However not all times we can use only values.......we might have to use a trick here and there.

- let me know b4 i can give it a try

- ash

not sure I understand the difference in your question ash. This is an absolute values problem.

The notation used for absolute values(modulus func) is |x|
The notation used for greatest integer value of x is [x]

Thats my understanding which I hope is correct. I didnt want to solve the problem before knowing that

Here's my attempt to solve the problem.
Let E => |x| >= |x-y| + |y|

1. given x > 0

for all values of y>x, E will not hold true.

So y>x cannot be true.
So A is sufficient.

2. given y > 0

for all x, where x<y E wont hold true because |x|<|y| always.

for x>y, E will hold true.

Sor for E to hold true, x>y must be true. So y>x is not true. B is sufficient.

MY ans is D.
_________________

ash
________________________
I'm crossing the bridge.........

Senior Manager
Joined: 07 Oct 2003
Posts: 353
Location: Manhattan
Followers: 2

Kudos [?]: 20 [0], given: 0

### Show Tags

28 Jun 2004, 13:19
ashkg wrote:
lastochka wrote:
ashkg wrote:
Is this a greatest integer function problem or a mod problem ?

for mod problems I would just take appropriate values and use. However not all times we can use only values.......we might have to use a trick here and there.

- let me know b4 i can give it a try

- ash

not sure I understand the difference in your question ash. This is an absolute values problem.

The notation used for absolute values(modulus func) is |x|
The notation used for greatest integer value of x is [x]

Thats my understanding which I hope is correct. I didnt want to solve the problem before knowing that

Here's my attempt to solve the problem.
Let E => |x| >= |x-y| + |y|

1. given x > 0

for all values of y>x, E will not hold true.

So y>x cannot be true.
So A is sufficient.

2. given y > 0

for all x, where x<y E wont hold true because |x|<|y| always.

for x>y, E will hold true.

Sor for E to hold true, x>y must be true. So y>x is not true. B is sufficient.

MY ans is D.

I couldn't figure out what key will produce "|" symbol (absolute value symbol). Which key is it on a keyboard? Thanks in advance.
Manager
Joined: 07 May 2004
Posts: 183
Location: Ukraine, Russia(part-time)
Followers: 2

Kudos [?]: 15 [0], given: 0

### Show Tags

28 Jun 2004, 14:16
lastochka wrote:
I couldn't figure out what key will produce "|" symbol (absolute value symbol). Which key is it on a keyboard? Thanks in advance.

lastochka, this symbol appears when you press Shift and backslash (it is to the right from "backspace" key).
Manager
Joined: 28 Jul 2004
Posts: 59
Location: Na
Followers: 1

Kudos [?]: 0 [0], given: 0

### Show Tags

28 Dec 2004, 04:33
Ash,

I have a question based on your explaination.Why do you presume for (2) that x<y will not hold true because |x|<|y| always?What is the relationship b/w both sets of inequality?How did you draw the // that x>y will hold in this case?Tx.

Anna

ashkg wrote:
lastochka wrote:
ashkg wrote:
Is this a greatest integer function problem or a mod problem ?

for mod problems I would just take appropriate values and use. However not all times we can use only values.......we might have to use a trick here and there.

- let me know b4 i can give it a try

- ash

not sure I understand the difference in your question ash. This is an absolute values problem.

The notation used for absolute values(modulus func) is |x|
The notation used for greatest integer value of x is [x]

Thats my understanding which I hope is correct. I didnt want to solve the problem before knowing that

Here's my attempt to solve the problem.
Let E => |x| >= |x-y| + |y|

1. given x > 0

for all values of y>x, E will not hold true.

So y>x cannot be true.
So A is sufficient.

2. given y > 0

for all x, where x<y E wont hold true because |x|<|y| always.

for x>y, E will hold true.

Sor for E to hold true, x>y must be true. So y>x is not true. B is sufficient.

MY ans is D.

_________________

We can crack the exam together

28 Dec 2004, 04:33
Display posts from previous: Sort by