← Complete problem index

PROJECT EULER · #1008

Functional Inverse

Statement only · UnsolvedOriginal problem ↗

Define the (N,M)-functional inverse of x2 to be the lowest-degree monic polynomial Q(x) such that Q(n2)n(modM) for all integers 0nN and all coefficients are non-negative and smaller than M.

For example, the (2,7)-functional inverse of x2 is x3+3x2+4x.

Find the coefficient of x10 in the (107,109+7)-functional inverse of x2.

Write-up coming later

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