int main() {
long answer = squareSums() - sumSquares();
printf("Project Euler 6 solution: %ld\n", answer);
return 0;
}
long long Sigma(const long long N, const long long M) {
// Evaluation of SIGMA2(N) modulo M
long long kstart = 1;
long long res = 0;
while (k <= N) {
long long mult = N/kstart;
long long kend = N/mult;
long long ss = sumSquares(kend, M) - sumSquares((kstart-1), M);
ss = (ss + M) % M;
res += ((mult % M) * ss) % M;
res %= M;
kstart = kend + 1;
}
return res;
}
unsigned int difSums(int n){
return sumSquared(n) - sumSquares(n);
}
