← Complete problem index

PROJECT EULER · #0875

Quadruple Congruence

Statement only · UnsolvedOriginal problem ↗

For a positive integer n we define q(n) to be the number of solutions to:

a12+a22+a32+a42b12+b22+b32+b42(modn)

where 0ai,bi<n. For example, q(4)=18432.

Define Q(n)=i=1nq(i). You are given Q(10)=18573381.

Find Q(12345678). Give your answer modulo 1001961001.

Write-up coming later

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