olymmath

CIIM 2024 Problem 1

  • Day 1

Sea (an)n≥1(a_n)_{n \geq 1} una sucesión de números reales. Se define la sucesión de funciones reales (fn)n≥0(f_n)_{n \geq 0} tal que para todo x∈Rx \in \mathbb{R} se cumple que:

f0(x)=1yfn(x)=∫anxfn−1(t) dtpara n≥1.f_0(x) = 1 \quad \text{y} \quad f_n(x) = \int_{a_n}^{x} f_{n-1}(t) \, dt \quad \text{para } n \geq 1.

Determinar todas las posibles sucesiones (an)n≥1(a_n)_{n \geq 1} tales que fn(0)=0f_n(0) = 0 para todo n≥2n \geq 2.

Nota: No necesariamente se cumple que f1(0)=0.f_1(0) = 0.

Official text Iberoamerican Interuniversity Mathematics Competition 2024 official paper, page 1. Quoted with source.

A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

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/2024/p1 · Tag MWSE77A0HE · Edit this page on GitHub · Keys: j next, k previous