How many symmetric and non-symmetric $n\times n$ matrices with $0/1$ entries are there such that every row is distinct and every column is distinct?
If only every row (or column) is distinct is needed, the answer is easy.
How many symmetric and non-symmetric $n\times n$ matrices with $0/1$ entries are there such that every row is distinct and every column is distinct?
If only every row (or column) is distinct is needed, the answer is easy.