MathLabs

Problem 3

Let N\mathbb{N} denote the set of positive integers. A function f:N→Nf:\mathbb{N}\to\mathbb{N} is said to be bonza if f(a)f(a) divides ba−f(b)f(a)b^a-f(b)^{f(a)} for all positive integers aa and bb. Determine the smallest real constant cc such that f(n)≤cnf(n)\le cn for all bonza functions ff and all positive integers nn.
Step 5 of 7: Bounding the power of 2 via 5^n - 1
v2(5n−1)=v2(n)+2 ⟹ f(n)≤2v2(n)+2≤4nv_2(5^n-1)=v_2(n)+2\ \Longrightarrow\ f(n)\le2^{v_2(n)+2}\le4n
Detailed analysis

By step 3, f(5)=1f(5)=1, so P(n,5)P(n,5) gives f(n)∣5n−f(5)f(n)=5n−1f(n)\mid5^n-f(5)^{f(n)}=5^n-1. By the lifting-the-exponent lemma (since 5≡1(mod4)5\equiv1\pmod4), v2(5n−1)=v2(n)+2v_2(5^n-1)=v_2(n)+2 for every nn. As f(n)f(n) is a power of 22 dividing 5n−15^n-1, this gives f(n)≤2v2(n)+2=4⋅2v2(n)≤4nf(n)\le2^{v_2(n)+2}=4\cdot2^{v_2(n)}\le4n, since 2v2(n)≤n2^{v_2(n)}\le n. Together with the trivial bound for f=idf=\mathrm{id} (where f(n)=n≤4nf(n)=n\le4n), every bonza function satisfies f(n)≤4nf(n)\le4n, so c=4c=4 works.