MathDB
T-grid problem

Source: 2010 AIME II Problem 11

April 1, 2010
linear algebramatrixrotationAMC

Problem Statement

Define a T-grid to be a 3×3 3\times3 matrix which satisfies the following two properties: (1) Exactly five of the entries are 1 1's, and the remaining four entries are 0 0's. (2) Among the eight rows, columns, and long diagonals (the long diagonals are {a13,a22,a31} \{a_{13},a_{22},a_{31}\} and {a11,a22,a33} \{a_{11},a_{22},a_{33}\}, no more than one of the eight has all three entries equal. Find the number of distinct T-grids.