Thursday, September 30, 2010
13th Mexican Mathematical Olympiad Problems 1999
13th Mexican Mathematical Olympiad Problems 1999A1. 1999 cards are lying on a table. Each card has a red side and a black side and can be either side up. Two players play alternately. Each player can remove any number of cards showing the same color from the table or turn over any number of cards of the same color. The winner is the player who removes the last card.
Subscribe to:
Post Comments (Atom)
Popular Posts
-
Boxhead The Zombie Wars Infomation: Fight an army of zombies using awesome new weapons How to play: WADS Keys to move. Space to shoot. Z to ...
-
Check the flag is a fun and simple puzzle game . In this game your task is to make the enemy flag with the army you have...
-
A1. Show that there are arbitrarily large numbers n such that: (1) all its digits are 2 or more; and (2) the product of any four of ...
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.