olymmath

OBM 2024 Problem 6

    Seja n>1n > 1 um inteiro positivo. Enumere em ordem crescente todas as frações irredutíveis do intervalo [0,1][0,1] que têm denominador positivo e menor ou igual a nn:

    01=p0q0<p1q1<⋯<pMqM=11.\frac{0}{1} = \frac{p_0}{q_0} < \frac{p_1}{q_1} < \cdots < \frac{p_M}{q_M} = \frac{1}{1}.

    Determine, em função de nn, o menor valor possível de qi−1+qi+qi+1q_{i-1} + q_i + q_{i+1}, 0<i<M0 < i < M.

    Por exemplo, se n=4n = 4, a enumeração é

    01<14<13<12<23<34<11,\frac{0}{1} < \frac{1}{4} < \frac{1}{3} < \frac{1}{2} < \frac{2}{3} < \frac{3}{4} < \frac{1}{1},

    onde p0=0p_0 = 0, p1=1p_1 = 1, p2=1p_2 = 1, p3=1p_3 = 1, p4=2p_4 = 2, p5=3p_5 = 3, p6=1p_6 = 1, q0=1q_0 = 1, q1=4q_1 = 4, q2=3q_2 = 3, q3=2q_3 = 2, q4=3q_4 = 3, q5=4q_5 = 4, q6=1q_6 = 1 e o mínimo procurado é 1+4+3=3+2+3=3+4+1=81 + 4 + 3 = 3 + 2 + 3 = 3 + 4 + 1 = 8.

    Official text Brazilian Mathematical Olympiad 2024 official paper, page 2. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/claude@2.1.318 (claude-opus-5-5). 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 br-obm/2024/p6 · Tag P2CC0N7THD · Edit this page on GitHub · Keys: j next, k previous