Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2013 IMO Problems/Problem 6"
 
(2 intermediate revisions by the same user not shown)
Line 3: Line 3:
  
 
Let <math>M</math> be the number of beautiful labelings, and let N be the number of ordered pairs <math>(x, y)</math> of positive integers such that <math>x + y \le n</math> and <math>\gcd(x, y) = 1</math>. Prove that <cmath>M = N + 1.</cmath>
 
Let <math>M</math> be the number of beautiful labelings, and let N be the number of ordered pairs <math>(x, y)</math> of positive integers such that <math>x + y \le n</math> and <math>\gcd(x, y) = 1</math>. Prove that <cmath>M = N + 1.</cmath>
 +
 +
==Solution==
 +
 +
{{solution}}
 +
 +
==See Also==
 +
*[[2013 IMO]]
 +
{{IMO box|year=2013|num-b=5|after=Last Problem}}

Latest revision as of 00:32, 19 November 2023

Problem

Let $n \ge 3$ be an integer, and consider a circle with $n + 1$ equally spaced points marked on it. Consider all labellings of these points with the numbers $0, 1, ... , n$ such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called beautiful if, for any four labels $a < b < c < d$ with $a + d = b + c$, the chord joining the points labelled $a$ and $d$ does not intersect the chord joining the points labelled $b$ and $c$.

Let $M$ be the number of beautiful labelings, and let N be the number of ordered pairs $(x, y)$ of positive integers such that $x + y \le n$ and $\gcd(x, y) = 1$. Prove that \[M = N + 1.\]

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

2013 IMO (Problems) • Resources
Preceded by
Problem 5 		1 • 2 • 3 • 4 • 5 • 6 Followed by
Last Problem
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2013_IMO_Problems/Problem_6&oldid=204561"