Bunuel
If \(ab=ac\) is \(b=2\)?
(1) \(c = 1\)
(2) \(a\) is a prime number and \(c\) is NOT a prime number
Hello, everyone. I approached this question as a scientist would, asking whether
b COULD or MUST equal 2 and running a few trials. With Statement (1), if c = 1, we know that ab = a. Is
b allowed to be 2 in such an equation? Sure, as long as
a equals 0. But then this notion, that a = 0, leads to the thought that
b could just as well be
anything other than 2, and the equation would still be valid. Conflicting results mean that Statement (1) is NOT sufficient.
For Statement (2), the smallest
prime number that
a can be is 2. We can substitute this value right away into the given equation:
\((2)b = (2)c\)
We can divide out the 2's to reach a logical endpoint:
\(b = c\)
Now, can
b equal 2? Well, if
c is NOT a prime number, then no,
b cannot be 2. There is no need to test other prime values for
a, since 3, 5, 7, 11, 13, and so on would only lead to the same simplified equation, that b = c. In the end,
if c is NOT prime and b equals c, then b CANNOT be 2. A single answer to the question, namely NO, is sufficient, so
the answer must be (B).
I hope this post may help someone who may have assumed too much (or too little) and jumped to a rash conclusion. Good luck with your studies.
- Andrew