olymmath

SE-SKOLORNAS 1994 Problem 6

    Let NN be the set of non-negative integers. The function f:N→Nf:N\to N satisfies f(a+b)=f(f(a)+b)f(a+b) = f(f(a)+b) for all a,ba, b and f(a+b)=f(a)+f(b)f(a+b) = f(a)+f(b) for a+b<10a+b < 10 . Also f(10)=1f(10) = 1 . How many three digit numbers nn satisfy f(n)=f(N)f(n) = f(N) , where NN is the "tower" 2,3,4,52, 3, 4, 5 , in other words, it is 2a2^a , where a=3ba = 3^b , where b=45b = 4^5 ?

    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 se-skolornas/1994/p6 · Tag WJJ9V1CJ3Z · Edit this page on GitHub · Keys: j next, k previous