MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

Binary Matrix Equal Row Column Sums

2175ExpertCombinatoricsCounting Principles
Let $a_{n}$ be the number of ways to fill an $n \times n$ board with the digits 0 and 1, such that the sum in each row and each column is the same. For example, the $2 \times 2$ boards that satisfy this rule are: | 0 | 0 | | :--- | :--- | | 0 | 0 | | 1 | 0 | | :--- | :--- | | 0 | 1 | | 0 | 1 | | :--- | :--- | | 1 | 0 | | 1 | 1 | | :--- | :--- | | 1 | 1 | Thus $a_{2}=4$. Compute the values of $a_{3}$ and $a_{4}$.
0 students attempted0% solvedRating 2175

Related practice paths

Olympiad-Style PracticeDeep contest practice for proof-style problem solving.How to Qualify for AIMEScore goals, contest choice, and prep habits for AIME hopefuls.AIME Practice StrategyHow to improve accuracy on high-difficulty problems.

Ready to check your answer?

Create an account to submit answers, save history, and track your rating.

Progressive Hints

Unlock hints one at a time — each reveals a little more without spoiling the solution.

Step-by-Step Solutions1

Multiple solution approaches with detailed walkthroughs, unlocked after you solve the problem.

AI-Powered Grading

Instant feedback on your answer — handles fractions, decimals, and equivalent forms.

Curated problem bank

Supported tracks for AMC, AIME, MATHCOUNTS, and olympiad-style training, plus global problem sources like UKMT, Euclid, and Kangaroo.