to proove: x<0 stem1 : x^3 (1-x^2) < 0 if the above statement has to be true, either x^3 or (1-x^2) has to be negative. we dont have a clue. INSUFF stem2 : x^2-1<0 cannot say if x<0, no clues INSUFF Now combining both 1 and 2: you can re-arrange the equation 2 as 1 -x^2 > 0 => multiplying by - chang...

given that k º 1 is not equal to 1 º k for some numbers k the operation º can be any of the operations : +, - or * (given) lets take + and k be 2 2 + 1 = 1+ 2 (so the operation is not +. the condition is not equal) 2 * 1 = 1 * 2 (the operation is also not *) but 2 -1 != 1 -2 (hence the operation mus...

From the first stem: 1000n= 5*600 + (n-5) x where n is the total no of days and x is the no of units produced for the rest of the days. Obviously not enough to solve the problem. From the second stem: 1000n = 4*1500 + (n-4) x1 where n is the total no of days and x1 is the no of units produced for th...

cubicle_bound_misfit : I always have this problem : when to simplify the given equation and when not to? for example, in the above question I simplified the equation to: y<0 since the first choice is x>0, and since we have derived y<0; (x-y) / (x+y) => will be like (x+y) /(x-y) there fore surely, th...

Strategy is POE and the process is clearly explained by Mani_mba.

let no of gold coins originally be x and no of non gold coins originally be n => one in six coins is gold no of gold coin originally = 1 no of non gold coins originally = total coins - gold coins = 6-1 =5 there fore forming an equation: x/n = 1/5 n= 5x 5x-n =0 -> eq1 =>If 10 non-gold coins are subse...