Suppose that , where equals 1 or -1, and equals 1 or -1, and equals 1 or -1. How many of the following statements are true? - can equal 0. - is always odd. - cannot equal 4. - is always even.
Solution
When with each of and equal to either 1 or -1, there are 8 possible combinations of values for and . From this information, cannot equal 0, is never odd, can equal 4, and is always even. Therefore, exactly one of the four given statements is true.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.