Last visit was: 19 Nov 2025, 14:05 It is currently 19 Nov 2025, 14:05
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
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
User avatar
lastochka
User avatar
Joined: 07 Oct 2003
Last visit: 15 Aug 2006
Posts: 193
Own Kudos:
68
Location: Manhattan
Posts: 193
Kudos: 68
This problem has been recently posted by halle i believe, I 26 Jun 2004, 18:33
Kudos
Add Kudos
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

(N/A)

Question Stats:

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

History

Date
Time
Result
Not Attempted Yet
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

explain your solution



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
User avatar
ashkg
User avatar
Joined: 21 Mar 2004
Last visit: 11 Sep 2009
Posts: 207
Own Kudos:
757
Location: Cary,NC
Posts: 207
Kudos: 757
This problem has been recently posted by halle i believe, I 27 Jun 2004, 23:56
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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
User avatar
Emmanuel
User avatar
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
23
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
This problem has been recently posted by halle i believe, I 28 Jun 2004, 00:15
Kudos
Add Kudos
Bookmarks
Bookmark this Post
lastochka
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

explain your solution
Show more


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.
User avatar
Emmanuel
User avatar
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
23
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
This problem has been recently posted by halle i believe, I 28 Jun 2004, 00:22
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
User avatar
lastochka
User avatar
Joined: 07 Oct 2003
Last visit: 15 Aug 2006
Posts: 193
Own Kudos:
68
Location: Manhattan
Posts: 193
Kudos: 68
This problem has been recently posted by halle i believe, I 28 Jun 2004, 06:31
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Emmanuel
lastochka
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

explain your solution

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.
Show more


since both are sufficient you mean the answer is D
other than that, I agree with your solution
User avatar
lastochka
User avatar
Joined: 07 Oct 2003
Last visit: 15 Aug 2006
Posts: 193
Own Kudos:
68
Location: Manhattan
Posts: 193
Kudos: 68
This problem has been recently posted by halle i believe, I 28 Jun 2004, 06:33
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ashkg
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
Show more


not sure I understand the difference in your question ash. This is an absolute values problem.
User avatar
Emmanuel
User avatar
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
23
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
This problem has been recently posted by halle i believe, I 28 Jun 2004, 06:39
Kudos
Add Kudos
Bookmarks
Bookmark this Post
lastochka
Emmanuel
lastochka
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

explain your solution

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
Show more


Yes, lastochka, I don't remember exact definitions for A,B,C,D,E, but I know the solution...
User avatar
Emmanuel
User avatar
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
23
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
This problem has been recently posted by halle i believe, I 28 Jun 2004, 06:40
Kudos
Add Kudos
Bookmarks
Bookmark this Post
lastochka

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


lastochka, ashkg want to say that [x] nay mean greatest integer, which is less than x.
User avatar
ashkg
User avatar
Joined: 21 Mar 2004
Last visit: 11 Sep 2009
Posts: 207
Own Kudos:
757
Location: Cary,NC
Posts: 207
Kudos: 757
This problem has been recently posted by halle i believe, I 28 Jun 2004, 09:42
Kudos
Add Kudos
Bookmarks
Bookmark this Post
lastochka
ashkg
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.
Show more


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.
User avatar
lastochka
User avatar
Joined: 07 Oct 2003
Last visit: 15 Aug 2006
Posts: 193
Own Kudos:
68
Location: Manhattan
Posts: 193
Kudos: 68
This problem has been recently posted by halle i believe, I 28 Jun 2004, 14:19
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ashkg
lastochka
ashkg
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.
Show more


I couldn't figure out what key will produce "|" symbol (absolute value symbol). Which key is it on a keyboard? Thanks in advance.
User avatar
Emmanuel
User avatar
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
23
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
This problem has been recently posted by halle i believe, I 28 Jun 2004, 15:16
Kudos
Add Kudos
Bookmarks
Bookmark this Post
lastochka

I couldn't figure out what key will produce "|" symbol (absolute value symbol). Which key is it on a keyboard? Thanks in advance.
Show more


lastochka, this symbol appears when you press Shift and backslash (it is to the right from "backspace" key).
User avatar
Anna Rama
User avatar
Joined: 28 Jul 2004
Last visit: 12 Feb 2005
Posts: 23
Own Kudos:
1
Location: Na
Posts: 23
Kudos: 1
This problem has been recently posted by halle i believe, I 28 Dec 2004, 05:33
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Ash,

I have a question based on your explaination.Why do you presume for (2) that xy will hold in this case?Tx.

Anna

ashkg
lastochka
ashkg
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 xy, 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.
Show more



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderators:
Bunuel
Math Expert
105390 posts
GMATBusters
GMAT Tutor
1924 posts