olymmath

CIIM 2014 Problem 6

  • Day 2

a) Let {xn}\{x_n\} be a sequence with xn∈[0,1]x_n \in [0,1] for any nn . Prove that there exists C>0C > 0 such that for every positive integer rr , there exists m≥1m \geq 1 and n>m+rn > m + r that satisfy (n−m)∣xn−xm∣≤C(n-m)|x_n-x_m| \leq C . b) Prove that for every C>0C > 0 , there exists a sequence {xn}\{x_n\} with xn∈[0,1]x_n \in [0,1] for all nn and an integer rr such that, if m≥1m \geq 1 and n>m+rn > m+r , then (n−m)∣xn−xm∣>C.(n-m)|x_n-x_m| > C.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ciim/2014/p6 · Tag V3HJY8R578 · Edit this page on GitHub · Keys: j next, k previous