I got following question:
Is n divisible by 11 with no remainder?
(1) n is divisible by m with integer result
(2) m is divisible by 5.5 with integer result
A. 1 alone, not 2 alone
B. 2 alone, not 1 alone
C. 1 and 2 together (need both) Answer
D. 1 alone or 2 alone
E. 1 and 2 together are not sufficient
I would say answer E is correct. But the official answer is C.
They argue that if n is divisible by m and m itself is divisible by 5.5, then n must be divisible by 5.5 and hence also by 11.
This is incorrect in my opinion, as both m and n could be 5.5, hence m is divisible by 5.5 with an integer as a result, n is divisible by m with an integer as a result (both 1), but if you divide n=5.5 by 11, you get .5 which is not an integer.
Please tell me where i am wrong,
Thanks guys!
Is n divisible by 11 with no remainder?
(1) n is divisible by m with integer result
(2) m is divisible by 5.5 with integer result
A. 1 alone, not 2 alone
B. 2 alone, not 1 alone
C. 1 and 2 together (need both) Answer
D. 1 alone or 2 alone
E. 1 and 2 together are not sufficient
I would say answer E is correct. But the official answer is C.
They argue that if n is divisible by m and m itself is divisible by 5.5, then n must be divisible by 5.5 and hence also by 11.
This is incorrect in my opinion, as both m and n could be 5.5, hence m is divisible by 5.5 with an integer as a result, n is divisible by m with an integer as a result (both 1), but if you divide n=5.5 by 11, you get .5 which is not an integer.
Please tell me where i am wrong,
Thanks guys!
