← Complete problem index

PROJECT EULER · #0479

Roots on the Rise

Statement only · SolvedOriginal problem ↗

Let ak, bk, and ck represent the three solutions (real or complex numbers) to the equation 1x=(kx)2(k+x2)kx.

For instance, for k=5, we see that {a5,b5,c5} is approximately {5.727244,0.363622+2.057397i,0.3636222.057397i}.

Let S(n)=p=1nk=1n(ak+bk)p(bk+ck)p(ck+ak)p.

Interestingly, S(n) is always an integer. For example, S(4)=51160.

Find S(106) modulo 1000000007.

Write-up coming later

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