Binary X-Grid

How many different ways are there to fill a 4 × 4 4 \times 4 grid with 1 and 0, such that the diagonals have no 0?

1024 128 256 512

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

David Vreken
Feb 19, 2019

Since the diagonals have no 0 0 , they must all be 1 1 :

This leaves 8 8 squares that can be either 0 0 or 1 1 , for a total of 2 8 = 256 2^8 = \boxed{256} different ways.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...