2010 C3

Discussion on International Mathematical Olympiad (IMO)
Facebook Twitter

2010 C3

Post Number:#1  Unread postby Kazi_Zareer » Mon Aug 08, 2016 1:31 am

$2500$ chess kings have to be placed on a $100 \times 100$ chessboard so that
(i) no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex);
(ii) each row and each column contains exactly $25$ kings.

Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.)
Last edited by Phlembac Adib Hasan on Mon Aug 08, 2016 8:54 am, edited 1 time in total.
Reason: Latexed and given appropriate title
We cannot solve our problems with the same thinking we used when we create them.
User avatar
Kazi_Zareer
 
Posts: 86
Joined: Thu Aug 20, 2015 7:11 pm
Location: Malibagh,Dhaka-1217

Share with your friends: Facebook Twitter

  • Similar topics
    Replies
    Views
    Author

Return to International Mathematical Olympiad (IMO)

Who is online

Users browsing this forum: No registered users and 2 guests