This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Roots on the Rise

Problem 479

Published on 06 September 2014 at 10:00 pm [Server Time]

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

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

Let S(n) = Σ (ak+bk)p(bk+ck)p(ck+ak)p for all integers p, k such that 1 ≤ p, kn.

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

Find S(106) modulo 1 000 000 007.


Answer not yet available
Go to back to Problems