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
During AMC testing, the AoPS Wiki is in read-only mode and no edits can be made.

2009 IMO Problems/Problem 1

Revision as of 05:08, 23 July 2009 by Bugi (talk | contribs) (Created page with '== Problem == Let <math>n</math> be a positive integer and let <math>a_1,\ldots,a_k (k\ge2)</math> be distinct integers in the set <math>\{1,\ldots,n\}</math> such that <math>n…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $n$ be a positive integer and let $a_1,\ldots,a_k (k\ge2)$ be distinct integers in the set $\{1,\ldots,n\}$ such that $n$ divides $a_i(a_{i+1}-1)$ for $i=1,\ldots,k-1$. Prove that $n$ doesn't divide $a_k(a_1-1)$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2009_IMO_Problems/Problem_1&oldid=32489"