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

Revision history of "2009 OIM Problems/Problem 2"

Diff selection: Mark the radio boxes 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.

  • (cur | prev) 15:17, 14 December 2023‎ Tomasdiaz (talk | contribs)‎ . . (391 bytes) (+391)‎ . . (Created page with "== Problem == For each positive integer <math>n</math> we define <math>a_n = n + m</math> where <math>m</math> is the largest integer such that <math>2^{2^m} \le n2^n</math>....")
Retrieved from "https://artofproblemsolving.com/wiki/index.php/2009_OIM_Problems/Problem_2"