Featured

The 53rd International Mathematical Olympiad: Problems and Solutions

Problem 3: The guessing game is a game played between two players ( A ) and ( B ). The rules of the game depend...

Mathematics as Problem Solving Second Edition by Alexander Soifer

This poses a problem: how does one reach out to the next generation and charm it into reading and doing mathematics? I am deeply...

Selected Problems of the Vietnamese Mathematical Olympiad (1962–2009) – Mathematical Olympiad Series Vol. 5

The International Mathematical Olympiad (IMO) - an annual international mathematical competition primarily for high school students - has a history of more than half...

Putnam Mathematical Olympiad 1934 – 2011

Putnam Mathematical Olympiad 1934 - 2011 Download...

British Mathematical Olympiad – Round 1 : Friday, 2 December 2011

British Mathematical Olympiad Round 1 : Friday, 2 December 2011 Time allowed 31 2 hours. Instructions • Full written solutions – not just answers – are required, with complete...

Latest Posts

Mathematical Reflections – Problems in Issue 4, 2012

Swift- geometry_pic_1.jpg

Download: Problems –...

Mathematical Reflections – Problems in Issue 3, 2012

Download: Problems -...

The 53rd International Mathematical Olympiad: Problems and Solutions

Problem 3: The guessing game is a game played between two players ( A ) and ( B ). The rules of the game depend on two positive integers ( k ) and ( n ) which are known to both players. At the start of the game the player (...

IMO Shortlist 2011 – Algebra

Algebra A7: Let  and  be positive real numbers satisfying  and  Prove that A5: Prove that for every positive integer  the set  can be partitioned into  triples in such a way that the numbers from each triple are the lengths of the sides of some obtuse triangle. A4: Determine all pairs  of functions from the set of positive integers to itsels that satisfy for every...

IMO Shortlist 2011 – Number Theory

Number Theory N8:  Let  and set  Prove that  is a prime number if and only if the following holds: there is a permutation  of the numbers  and a sequence of integers  such that  divides  for every where we set  N7: Let  be an odd prime number. For every integer  define the number  Let  such that  Prove that  divides  N6: Let  and  be two polynomials with integer coefficients, such that no nonconstant...