Iterates of increasing sequences of positive integers (Q2248828): Difference between revisions

Let \(n \geq 1\), \(K \geq 2\) and \(D \geq 2\) be positive integers. The functional equation \(a^K(n)=Dn\) for an increasing sequence of positive integers \(a(n)\) is considered, where \(a^1(n):=a(n)\), \(a^j(n):=a^{j-1}(a(n))\). The authors prove that if \((D-1)|K\), then there exists a unique solution of the functional equation. Otherwise, there are uncountably many solutions.