Colouring Points of the Integer Lattice!

Consider a square in the Cartesian plane whose vertices are A ( 0 , 0 ) , B ( 10 , 0 ) , C ( 10 , 10 ) , D ( 0 , 10 ) A(0,0) \ , \ B(10,0) \ , \ C(10,10) \ , \ D(0,10) . The grid points of the integer lattice inside or on the boundary of this square are coloured either red or green in such a way that every unit square in the lattice has exactly two red vertices. How many such colorings are possible?


The answer is 4094.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...