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

1988 OIM Problems/Problem 6

Revision as of 13:11, 13 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Consider the sets of <math>n</math> natural numbers different than zero out of which there are not three elements in arithmetic progression. Prove that in one o...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Consider the sets of $n$ natural numbers different than zero out of which there are not three elements in arithmetic progression.

Prove that in one of those sets, the sum of the inverse of its elements is maximum.

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=1988_OIM_Problems/Problem_6&oldid=206989"