2020 AMC 10 A

Complete problem set with solutions and individual problem pages

Problem 18 Hard

Let (a, b, c, d) be an ordered quadruple of not necessarily distinct integers, each one of them in the set 0,1,2,3. For how many such quadruples is it true that a \cdot d-b \cdot c is odd? (For example, (0,3,1,1) is one such quadruple, because 0 \cdot 1-3 \cdot 1=-3 is odd.)

  • A.

    48

  • B.

    64

  • C.

    96

  • D.

    128

  • E.

    192

Answer:C

Solution 1 (Parity): In order for a \cdot d-b \cdot c to be odd, consider parity. We must have (even)(odd) or (odd)-(even). There are 2 \cdot 4+2 \cdot 2=12 ways to pick numbers to obtain an even product. There are 2 \cdot 2=4 ways to obtain an odd product. Therefore, the total amount of ways to make a \cdot d-b \cdot c odd \text { is } 2 \cdot(12 \cdot 4)=(\mathbf{C}) 96 Solution 2 (Basically Solution 1 but more in depth): Consider parity. We need exactly one term to be odd, one term to be even. Because of symmetry, we can set a d to be odd and b c to be even, then multiply by 2 . If a d is odd, both a and d must be odd, therefore there are 2 \cdot 2=4 possibilities for a d. Consider b c. Let us say that b is even. Then there are 2 \cdot 4=8 possibilities for b c. However, b can be odd, in which case we have 2 \cdot 2=4 more possibilities for b c. Thus there are 12 ways for us to choose b c and 4 ways for us to choose a d. Therefore, also considering symmetry, we have 2 * 4 * 12=96 total values of a d-b c .(C)