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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

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

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.

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

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.

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.

Hello everyone! Researching, networking, and understanding the “feel” for a school are all part of the essential journey to a top MBA. Wouldn’t it be great... ...

Are you interested in applying to business school? If you are seeking advice about the admissions process, such as how to select your targeted schools, then send your questions...