Difference between revisions of "1988 OIM Problems/Problem 6"

(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...")
 
 
Line 3: Line 3:
  
 
Prove that in one of those sets, the sum of the inverse of its elements is maximum.
 
Prove that in one of those sets, the sum of the inverse of its elements is maximum.
 +
 +
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
  
 
== Solution ==
 
== Solution ==
 
{{solution}}
 
{{solution}}
 +
 +
== See also ==
 +
https://www.oma.org.ar/enunciados/ibe3.htm

Latest revision as of 13:29, 13 December 2023

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.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

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

See also

https://www.oma.org.ar/enunciados/ibe3.htm