+0  
 
0
76
3
avatar+41 

In how many ways can we place anywhere from \(0\) to \(9\) indistinguishable checkers on a \(3 \times 3\) checkerboard (no more than one checker per square), such that no row or column contains exactly \(1\) checker?

 Apr 13, 2020
edited by MathsAreFun  Apr 13, 2020
 #1
avatar+631 
+1

You missed some latex!

 Apr 13, 2020
 #2
avatar+41 
0

Sorry its \(0\) to \(9\)!

MathsAreFun  Apr 13, 2020
 #3
avatar+109519 
0

Please edit your question so that it reads properly.

Melody  Apr 13, 2020

18 Online Users

avatar
avatar