Problem Collection for Asian-Pacific Mathemacal Olympiad

History and System

The Asian-Pacific Mathematical Olympiad (APMO) is a mathematical competition for high-school students that are predominantly from the Pacific region. A few countries without a Pacific coast also participate. The first APMO was held in 1989 and since then it is held annually. Nowadays there are 25 member countries of APMO.

The competition usually takes place in March, but it is organized separately in each member country and not everywhere at the same date, so the problems are to be kept confidential until those are officially released by the organizer. However, this feature caused some severe troubles in the period 1999-2002 when the problems got discussed over the internet before the competition took place in all countries.

The Competition and Awards

Each country sends up to ten contestants which compete individually. Participants are given 4 hours to solve 5 problems. Each problem is worth 7 points, making 35 the maximum possible score. The problems can also be found on the Canadian website [AP].

Successful contestants are awarded first, second, and third prizes, but the criterion depends on a particular country, making approximately equal distribution of medals in each country (usually 1 gold, 2 silver and 4 bronze medals). The criterion of awarding honorable mentions is not fixed either.

Problems

The total number of available problems is 95.
 1989    APMO  
 1990    APMO  
 1991    APMO  
 1992    APMO  
 1993    APMO  
 1994    APMO  
 1995    APMO  
 1996    APMO  
 1997    APMO  
 1998    APMO  
 1999    APMO  
 2000    APMO  
 2001    APMO  
 2002    APMO  
 2003    APMO  
 2004    APMO  
 2005    APMO  
 2006    APMO  
 2007    APMO  
 2008    APMO  
 2010    APMO  
 2011    APMO  
 2012    APMO
 2013    APMO
 2014    APMO
 2015    APMO
 2016    APMO
 2017    APMO
 2018    APMO
 2019    APMO

2005-2017 IMOmath.com | imomath"at"gmail.com | Math rendered by MathJax
Home | Olympiads | Book | Training | IMO Results | Forum | Links | About | Contact us