Computation Workshop Solution Checker

Recursively Defined Function

The function \(f\) is defined on positive integers by \(f(p)=1\) for all prime numbers \(p\), and \(f(xy) = xf(y) + yf(x)\) for all positive integers \(x\) and \(y\). We are interested in finding integers \(n\) such that \(n=f(n)\).