olymmath

CONO-SUR 2017 Problem 5

    Let aa , bb and cc positive integers. Three sequences are defined as follows:

    • a1=aa_1=a , b1=bb_1=b , c1=cc_1=c [/*]
    • an+1=⌊anbn⌋a_{n+1}=\lfloor{\sqrt{a_nb_n}}\rfloor ,  bn+1=⌊bncn⌋\:b_{n+1}=\lfloor{\sqrt{b_nc_n}}\rfloor ,  cn+1=⌊cnan⌋\:c_{n+1}=\lfloor{\sqrt{c_na_n}}\rfloor for n≥1n \ge 1 [/*] [/list]

    [list = a]

    • Prove that for any aa , bb , cc , there exists a positive integer NN such that aN=bN=cNa_N=b_N=c_N .[/*]
    • Find the smallest NN such that aN=bN=cNa_N=b_N=c_N for some choice of aa , bb , cc such that a≥2a \ge 2 y b+c=2a−1b+c=2a-1 .[/*]

    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 cono-sur/2017/p5 · Tag 6B0CCJ3VM9 · Edit this page on GitHub · Keys: j next, k previous