Art of Problem Solving
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

2010 IMO Problems/Problem 6: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)

6 October 2022

30 September 2022

3 April 2012

20 July 2010

  • curprev 10:1410:14, 20 July 2010 Bugi talk contribs 452 bytes +452 Created page with '== Problem == Let <math>a_1, a_2, a_3, \ldots</math> be a sequence of positive real numbers, and <math>s</math> be a positive integer, such that <cmath>a_n = \max \{ a_k + a_{n-…'
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://wiki.aopstest.com/wiki/index.php?title=2010_IMO_Problems/Problem_6"