Processing math: 100%

Problem #186

Euler and Fibo

S(a,b) = \sum_{k|a,k|b}^{} \Phi(k)

where k|x means k divides x, \Phi(n) is euler totient

F(n) = F(n-1) + F(n-2) for n >1

F(0) = 0 and F(1) = 1

Find Z0(n)^{Z1(n)} mod 10^9 + 7 for n = 10^8

Contributed by Project Gauss

Solved by 20 users

Log in to submit answers.

Is something wrong?

Maintaining a collection of high quality questions is our top priority. If, however, you do find an error, report the problem and we'll make sure it is reviewed soon.