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

2013 Canadian MO Problems/Problem 2

Revision as of 01:18, 27 November 2023 by Tomasdiaz (talk | contribs) (Created page with "==Problem == The sequence <math>a_1, a_2, \dots, a_n</math> consists of the numbers <math>1, 2, \dots, n</math> in some order. For which positive integers <math>n</math> is it...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

The sequence $a_1, a_2, \dots, a_n$ consists of the numbers $1, 2, \dots, n$ in some order. For which positive integers $n$ is it possible that the $n+1$ numbers $0, a_1, a_1+a_2, a_1+a_2+a_3,\dots, a_1 + a_2 +\cdots + a_n$ all have di fferent remainders when divided by $n + 1$?

Solution

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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2013_Canadian_MO_Problems/Problem_2&oldid=206070"