← Complete problem index

PROJECT EULER · #0811

Bitwise Recursion

Statement only · UnsolvedOriginal problem ↗

Let b(n) be the largest power of 2 that divides n. For example b(24)=8.

Define the recursive function: A(0)=1A(2n)=3A(n)+5A(2nb(n))n>0A(2n+1)=A(n) and let H(t,r)=A((2t+1)r).

You are given H(3,2)=A(81)=636056.

Find H(1014+31,62). Give your answer modulo 1000062031.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.