Suppose , , , and . The number of such pairs is ( ).
Solution
Since , . In order to satisfy , we have
or
So the number of pairs is . Answer: C.
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.