cool math games boombot funbrain cool math games civiballs cooking games cool math games kids cool math games crazy taxi cool games cool educational games
Wednesday, November 24, 2010
28th International Mathematical Olympiad 1987 Problems & Solutions
A1. Let pn(k) be the number of permutations of the set {1, 2, 3, ... , n} which have exactly k fixed points. Prove that the sum from k = 0 to n of (k pn(k) ) is n!. [A permutation f of a set S is a one-to-one mapping of S onto itself. An element i of S is called a fixed point if f(i) = i.] A2. In an acute-angled triangle ABC the interior bisector of angle A meets BC at L
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 ...
-
Avatar Fortress Fight 2 Infomation: Launch fireballs and more at the other village. Try to take down their dojo by launching weapons. How to...
-
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.