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.