olymmath

AUSTRIAN-POLISH 1989 Problem 7

    Functions f0,f1,f2,...f_0, f_1,f_2,... are recursively defined by f0(x)=xf_0(x) = x and f2k+1(x)=3f2k(x)f_{2k+1} (x) = 3^{f_{2k}(x)} and f2k+2=2f2k+1(x)f_{2k+2} = 2^{f_{2k+1}(x)} , k=0,1,2,...k = 0,1,2,... for all x∈Rx \in R . Find the greater one of the numbers f10(1)f_{10}(1) and f9(2)f_9(2) .

    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 austrian-polish/1989/p7 · Tag WVR4A3148A · Edit this page on GitHub · Keys: j next, k previous