How many ways are there to arrange the digits $1$ through $9$ a $3 \times 3$ grid with restrictions? I tried each possibility and add them together, which was very time consuming. What is the easiest way to solve this problem? Thank you very much in advance! 
How many ways are there to arrange the digits $1$ through $9$ in this $3 \times 3$ grid, such that the numbers are increasing from left to right in each row and increasing from top to bottom in each column?

 A: Putting numbers into such an arrangement of boxes so that they are increasing along rows and increasing down columns is a classic problem, and these objects are called standard Young tableaux. 
If there are $\lambda_i$ boxes in the $i$th row, then the quantity you want is usually denoted $f^\lambda$ with $\lambda=(\lambda_1,\lambda_2,...)$. It turns out that $f^\lambda$ is the dimension of the irreducible representation of the permutation group associated with the integer partition $\lambda$ (outside of scope to define all this here).
There is a formula for $f^\lambda$ for all $\lambda$ which you can find here: https://en.wikipedia.org/wiki/Hook_length_formula
The particular case of $n\times n$ grids has the solution $ (n^2)! \prod_{k=0}^{n-1}\frac{k!}{(n+k)!}$ and for $n=3$ this is $42$.
A: The $1$ has to be upper left and the $9$ has to be lower right.  The $2$ can be upper center or middle left.  By symmetry, we might as well put the $2$ in upper center and double the count for the middle left.  The $8$ has two choices.  For each of them, there will be two choices for $3$ and two for $7$.  That gives eight grids, each of which will have constraints on $4,5,6$.
