The Complete Guide to the 9th International Mathematical Olympiad (IMO 1967)

The International Mathematical Olympiad (IMO) is the world’s most prestigious mathematics competition for high school students. Since its establishment in 1959, the IMO has inspired generations of young mathematicians by presenting proof-based problems that reward creativity, logical reasoning, and elegant mathematical thinking. Unlike traditional school examinations, contestants are not expected to memorize formulas or follow routine procedures. Instead, they must discover original ideas, identify hidden mathematical patterns, and present complete and rigorous proofs.

The 9th International Mathematical Olympiad (IMO 1967) was held in Cetinje, Yugoslavia (now Montenegro), in July 1967. Welcoming 13 countries to compete through pure mathematical ingenuity, geometric visualization, and sharp analytical reasoning, the competition continued building the classic proof-based Olympiad tradition.

The IMO 1967 problem set is celebrated as a classic example of Olympiad craftsmanship. The six carefully selected problems spanned the four fundamental branches of Olympiad mathematics—number theory, algebra, geometry, and combinatorics. Every question required contestants to think deeply, recognize hidden structural symmetries, and build complete, airtight proofs rather than relying on lengthy calculations.

More than fifty years later, the IMO 1967 problems and solutions remain an essential training resource for Olympiad students worldwide. National training camps, mathematics clubs, universities, and experienced Olympiad coaches continue recommending this paper because the techniques it teaches—such as circle-covering inequalities in parallelograms, tetrahedron volume bounds under edge constraints, prime-modulus divisibility of products, extremal triangles circumscribing acute triangles, power-sum sequences with infinitely many zeros, and medal-distribution recurrences—are timeless.

One of the greatest strengths of IMO 1967 is its carefully balanced progression in difficulty. The opening problems introduce accessible geometry and volume inequalities while allowing contestants to gain momentum. As the examination progresses, the problems become increasingly sophisticated, demanding deeper insight and stronger proof-writing skills. This gradual escalation makes IMO 1967 one of the finest training papers for students preparing for IMO, IOQM, RMO, INMO, APMO, USAMO, EGMO, BMO, and other national and international mathematics competitions.

Studying IMO 1967 is about much more than learning six official solutions. Every problem teaches students how professional mathematicians approach unfamiliar situations, simplify complicated ideas, investigate small examples, discover hidden relationships, and communicate their reasoning through elegant proofs. These habits remain valuable not only in mathematics competitions but also in engineering, computer science, artificial intelligence, economics, statistics, and scientific research.

In this complete guide, we will explore the structure of IMO 1967, discuss its mathematical themes, examine the nature of each problem, and show how students can use this classic paper to become stronger mathematical thinkers.

Overview of IMO 1967

DetailInformation
Olympiad9th International Mathematical Olympiad
Host CityCetinje
CountryYugoslavia (Montenegro)
Competition DatesJuly 1967 (Exam days 4–5 July 1967)
Participating Countries13
Total Problems6 Proof-Based Problems
Examination Days2
Time Per Day4 Hours
Maximum Score40 Marks (Weighted scoring used prior to 1981)

The competition followed the classic two-day IMO examination format.

Day One

  • Problem 1 (6 Marks)
  • Problem 2 (7 Marks)
  • Problem 3 (8 Marks)

Day Two

  • Problem 4
  • Problem 5 (7 Marks)
  • Problem 6

Contestants worked through three proof-based problems in 4 hours on each examination day. Unlike modern IMOs where every problem carries 7 points for a total of 42, IMO 1967 used weighted scores summing to a maximum possible score of 40 points.

Why IMO 1967 Is Still Worth Studying

Every International Mathematical Olympiad develops its own mathematical character. Some competitions are remembered for heavy algebra, while others become famous for intricate combinatorics. IMO 1967 stands out for its parallelogram disk-covering threshold, tetrahedron single-long-edge volume bound, prime-factor divisibility on quadratic products, circumscribed triangle area maximization, power-sum vanishing sequences, and step-by-step medal-distribution arithmetic.

The opening problems reward geometric distance/area reasoning and spatial slicing. The later problems demand originality, persistence, and true mathematical maturity. Experienced Olympiad coaches continue recommending IMO 1967 because every official solution demonstrates that recognizing hidden structure is always far more powerful than memorizing formulas.

The Four Major Areas of Olympiad Mathematics

The IMO 1967 paper covers all four classical Olympiad disciplines.

Number Theory & Sequences

Number theory and sequences remain rewarding Olympiad subjects because elementary statements often produce crisp, airtight proofs. Important concepts include:

  • Prime modulus divisibility of products of differences c_{m+i} – c_k where c_s = s(s + 1)
  • Power-sum sequences c_n = a_1^n + a_2^n + … + a_8^n with infinitely many zero terms
  • Pairing opposite real numbers and analyzing parity/exponents

Geometry (2D & 3D)

Geometry develops spatial intuition, transformation thinking, and rigorous deductive writing. Important topics include:

  • Covering a parallelogram AB = a, AD = 1, angle BAD = alpha with four unit circles
  • Tetrahedra with exactly one edge greater than 1 having volume at most 1/8
  • Circumscribing triangles of maximum area around acute-angled triangles

Combinatorics & Word Problems

Combinatorics and discrete problems develop logical organization, structural counting, and extremal thinking. Important techniques include:

  • Working backward or setting up equations for multi-day medal distributions
  • Checking integrality and feasibility of solutions

Algebra & Extremal Reasoning

Algebra and extremal arguments clarify how parameters govern existence and optimality. Important techniques include:

  • Necessary and sufficient parameter conditions (if and only if bounds)
  • Maximizing geometric areas under side and angle constraints

Difficulty Analysis of IMO 1967

ProblemSubjectEstimated Difficulty
Problem 12D Geometry (Circle Covering)⭐⭐⭐☆☆
Problem 23D Geometry (Tetrahedron Volume)⭐⭐⭐☆☆
Problem 3Number Theory (Divisibility)⭐⭐⭐⭐☆
Problem 4Geometry (Max Area Circumscribing)⭐⭐⭐⭐☆
Problem 5Sequences / Algebra (Power Sums)⭐⭐⭐⭐☆
Problem 6Word Problem / Number Theory⭐⭐☆☆☆

The paper opens with a circle-covering parallelogram condition and a tetrahedron volume bound on Day 1, and continues on Day 2 with circumscribed area maximization, power-sum sequences, and a medal-distribution puzzle.

What Makes IMO 1967 Special?

The 9th International Mathematical Olympiad showcases classic Olympiad problem design: concise statements that require careful geometric and algebraic insight. From deriving the exact threshold a <= cos(alpha) + sqrt(3) sin(alpha) for four unit circles to cover a parallelogram, to finding the exact number of contest days and medals in Problem 6, every question rewards clarity of thought.

Skills You Will Develop by Studying IMO 1967

Working carefully through the complete IMO 1967 paper helps students develop:

  • Necessary-and-sufficient proof structure for geometric inequalities
  • Spatial decomposition and cross-sectional maximization for tetrahedra
  • Prime-factor and divisibility reasoning on products
  • Area maximization and geometric construction for triangles
  • Power-sum sequence analysis when infinitely many terms vanish
  • Clean algebraic modeling for multi-step counting problems
  • Proof-writing clarity and rigor
  • Confidence during timed competitions

These abilities remain valuable in mathematics, engineering, computer science, artificial intelligence, economics, physics, statistics, and scientific research.

Before Reading the Official Solutions

One of the biggest mistakes Olympiad students make is reading the official solutions too early. Instead, spend time exploring every problem independently:

  • Test special angles like alpha = 60 degrees or alpha = 90 degrees in Problem 1 to check where the parallelogram might fail to be covered.
  • Experiment with flat or orthogonal-plane tetrahedra in Problem 2 to see how volume reaches 1/8.
  • Test small values of n, k, and m in Problem 3 to see why p = m + k + 1 matters.
  • Write down your own observations before checking any hints.

Even unsuccessful attempts strengthen mathematical intuition. Remember that Olympiad preparation is not about memorizing solutions—it is about learning how mathematicians think.

As an Olympiad coach, I often remind students that successful mathematics begins with observation, not calculation. The IMO 1967 paper perfectly illustrates this principle. Strong contestants test small cases, exploit symmetry, check extreme configurations, and simplify complicated conditions before writing a formal proof.

A Coach’s Analysis of Every Problem

Each problem in IMO 1967 develops a distinct mathematical skill. Understanding the nature of each problem is far more valuable than simply memorizing the official solutions.

Problem 1 – Parallelogram Circle Covering

  • Subject: 2D Geometry
  • Difficulty: ⭐⭐⭐☆☆

Let ABCD be a parallelogram with AB = a, AD = 1, and angle BAD = alpha, where triangle ABD is acute. Contestants must prove that four circles of radius 1 centered at A, B, C, and D cover the parallelogram if and only if a <= cos(alpha) + sqrt(3) sin(alpha).

Important Mathematical Ideas

  • Distance from interior points of the parallelogram to the nearest vertex A, B, C, or D
  • Acute triangle ABD angle constraints
  • Proving both necessity and sufficiency of the trigonometric bound

Coaching Advice
Identify the hardest-to-cover points inside the parallelogram—such as the center or regions near the middle of the sides—and express their distance to the vertices in terms of a and alpha.

Problem 2 – Tetrahedron Volume Bound

  • Subject: 3D Geometry (Tetrahedra)
  • Difficulty: ⭐⭐⭐☆☆

Problem 2 asks contestants to prove that if one and only one edge of a tetrahedron has length greater than 1 (all other five edges having length at most 1), then the volume of the tetrahedron is at most 1/8.

Important Concepts

  • Volume formula V = (1/3) * Base Area * Height
  • Maximizing height by placing planes perpendicular
  • Achieving equality V = 1/8 on an explicit configuration

Coaching Advice
Let AB be the unique edge with length greater than 1, and look at cross sections or heights relative to the remaining edges of length at most 1. Check when the upper bound 1/8 is actually attained.

Problem 3 – Divisibility of Quadratic Products

  • Subject: Number Theory
  • Difficulty: ⭐⭐⭐⭐☆

Let k, m, n be natural numbers such that p = m + k + 1 is a prime greater than n + 1, and define c_s = s(s + 1). Contestants must prove that (c_{m+1} – c_k)(c_{m+2} – c_k)…(c_{m+n} – c_k) is divisible by c_1 c_2 … c_n.

Important Concepts

  • Factoring c_{m+i} – c_k = (m + i – k)(m + i + k + 1)
  • Prime divisibility when p = m + k + 1 > n + 1
  • Divisibility of products of consecutive integers

Coaching Advice
Factor each term c_{m+i} – c_k using s(s + 1) – k(k + 1) = (s – k)(s + k + 1). Notice how m + k + 1 appears cleanly and why being prime greater than n + 1 prevents unwanted cancellations or missing prime powers.

Problem 4 – Maximum Area Circumscribing Triangle

  • Subject: Geometry
  • Difficulty: ⭐⭐⭐⭐☆

Given two acute-angled triangles A_0 B_0 C_0 and A_1 B_1 C_1, consider all triangles whose sides (or extensions) pass through the vertices of A_1 B_1 C_1 and contain A_0 B_0 C_0 (with A_0, B_0, C_0 on the sides of the outer triangle). Contestants must determine and construct the triangle of maximum area.

Important Mathematical Ideas

  • Area maximization under side/angle constraints
  • Geometric construction of the extremal triangle
  • Angle and perpendicularity conditions at vertices

Coaching Advice
Analyze how shifting or rotating the enclosing lines changes the triangle’s area, and look for symmetry or right/perpendicular relationships that lock the maximum area in place.

Problem 5 – Power-Sum Sequence with Zeros

  • Subject: Sequences / Algebra
  • Difficulty: ⭐⭐⭐⭐☆

Consider the sequence c_n = a_1^n + a_2^n + … + a_8^n where a_1, a_2, …, a_8 are real numbers not all equal to zero. Given that infinitely many terms c_n equal zero, contestants must find all natural numbers n for which c_n = 0.

Important Concepts

  • Behavior of power sums as n grows or varies by parity
  • Canceling opposite real numbers a_i + a_j = 0
  • Why infinitely many zero terms force special structure on the a_i

Coaching Advice
Look at the largest magnitude among |a_1|, …, |a_8| and consider odd versus even powers. When infinitely many terms vanish, dominant terms cannot survive indefinitely without canceling.

Problem 6 – Multi-Day Medal Distribution

  • Subject: Word Problem / Number Theory
  • Difficulty: ⭐⭐☆☆☆

In a sports contest lasting n days (n > 1) with m medals total, on day 1 one medal plus 1/7 of the remaining m – 1 medals are awarded; on day 2, two medals plus 1/7 of the remainder are awarded; and so on, until day n awards the remaining n medals. Contestants must find n and m.

Important Concepts

  • Setting up recurrence relations for remaining medals
  • Solving for integer values of n and m
  • Verifying that the solution produces whole numbers of medals each day

Coaching Advice
Let r_k denote the number of medals remaining after day k, and write r_k in terms of r_{k-1}. Use the fact that on day n all remaining n medals are taken so r_n = 0, then verify every daily award is an integer.

Five Common Mistakes Olympiad Students Make

  1. Proving Only One Direction in Problem 1: An “if and only if” condition requires proving both that covering forces the inequality and that the inequality guarantees covering.
  2. Forgetting the Unique-Edge Condition in Problem 2: The bound 1/8 relies on having only one edge greater than 1; if more edges exceed 1, the argument breaks down.
  3. Overlooking Prime Conditions in Problem 3: Using the fact that m + k + 1 is prime and greater than n + 1 is essential for handling prime factors cleanly.
  4. Omitting the Construction in Problem 4: Finding the maximum area is incomplete without showing how to construct the triangle that achieves it.
  5. Skipping Feasibility Checks in Problem 6: Solving an equation for n and m is not enough—always check that every day’s medal count is a non-negative integer.

A Four-Week Study Plan Using IMO 1967

Rather than solving all six problems at once, study them systematically.

Week One
Attempt Problems 1 and 6 under examination conditions. Work through the parallelogram covering condition in Problem 1 and the medal recurrence in Problem 6 before reading the official solutions.

Week Two
Focus on Problem 2. Analyze tetrahedron volume and edge constraints carefully, testing where equality holds.

Week Three
Study Problem 3 and Problem 5. Practice factoring c_{m+i} – c_k in Problem 3 and analyzing power sums with infinitely many zero terms in Problem 5.

Week Four
Dedicate the week to Problem 4. Work on the geometric reasoning and construction for the triangle of maximum area.

Why Olympiad Coaches Still Recommend IMO 1967

More than fifty years after the competition, IMO 1967 remains one of the finest Olympiad papers available. It teaches students how to recognize mathematical structures, construct elegant proofs, communicate ideas clearly, and think creatively. These abilities continue to define success in modern mathematics Olympiads and advanced university mathematics.

Who Should Study IMO 1967?

The IMO 1967 paper is highly recommended for:

  • Students preparing for the International Mathematical Olympiad (IMO)
  • IOQM, RMO, and INMO aspirants
  • APMO participants
  • USAMO, EGMO, and BMO competitors
  • Mathematics teachers
  • Olympiad coaches
  • University students studying proof-based mathematics

Whether your goal is earning an Olympiad medal or becoming a stronger mathematical thinker, IMO 1967 provides exceptional preparation.

The 9th International Mathematical Olympiad (IMO 1967) remains one of the most respected competitions in Olympiad history. Hosted in Cetinje, Yugoslavia, it presented six elegant proof-based problems that continue to inspire generations of mathematics students. Every problem demonstrates that true mathematical success comes from creativity, logical reasoning, careful observation, and rigorous proof-writing rather than memorized formulas or lengthy calculations. As you work through the IMO 1967 paper, remember that every unsuccessful attempt strengthens your intuition, every completed proof improves your reasoning, and every elegant solution deepens your appreciation for mathematics.

Frequently Asked Questions (FAQ)

1. Where was IMO 1967 held?
The 9th International Mathematical Olympiad was held in Cetinje, Yugoslavia (now Montenegro), in July 1967.

2. How many countries participated in IMO 1967?
A total of 13 countries participated in the 1967 competition.

3. Why was the maximum score 40 instead of 42 in IMO 1967?
Prior to 1981, IMO problems used weighted point values rather than the modern 7-point-per-problem system totaling 42.

4. Which mathematical subjects appeared in IMO 1967?
The paper covered 2D and 3D Geometry, Number Theory, Sequences/Algebra, and Word/Counting Problems.

5. Is IMO 1967 suitable for beginners?
Yes. Students starting proof-based Olympiad training can begin with Problem 6 (medal distribution) and Problem 2 (tetrahedron volume) before tackling the deeper divisibility, sequence, and extremal geometry problems.

6. Is IMO 1967 still useful for modern Olympiad preparation?
Absolutely. Techniques like proving both directions of a geometric bound, using prime divisibility on factored expressions, and analyzing sequence zeros remain staples of Olympiad mathematics.

7. What is the biggest lesson students can learn from IMO 1967?
The greatest lesson is to verify edge cases, check both necessary and sufficient conditions, and write complete, crystal-clear proofs.

Continue Your Olympiad Journey

After completing IMO 1967, continue your preparation with IMO 1968, IMO 1969, IMO 1970, and IMO 1971. Studying complete IMO papers in chronological order helps you recognize recurring mathematical ideas, strengthen proof-writing skills, and steadily develop the creativity and mathematical maturity required for success in national and international mathematics Olympiads.

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top