Alternating GCD Sum

Problem Statement

For a positive integer $n$, the function $g(n)$ is defined as

$$\displaystyle g(n)=\sum_{i=1}^{n} (-1)^i \gcd \left(n,i^2\right).$$

For example, $g(4) = -\gcd \left(4,1^2\right) + \gcd \left(4,2^2\right) - \gcd \left(4,3^2\right) + \gcd \left(4,4^2\right) = -1+4-1+4=6$.
You are also given $g(1234)=1233$.

Let $\displaystyle G(N) = \sum_{n=1}^N g(n)$. You are given $G(1234) = 2194708$.

Find $G(3 \times 2^N)$.

Submit Answers

You need to submit in the format: "N:problem(N)", possibly with multiple values at once, separated by commas, with $N$ between $1$ and $100$.

Top Users

🥇 icy
27.00 (60)
🥈 shs10978
27.00 (27)
🥉 mmtg
13.00 (13)
4 jonnytang
10.00 (10)

Data

Stats

Your submissions will appear here

Recent Submissions

1
mmtg
$g(13)$, $10$ digits 2 weeks, 2 days ago
2
mmtg
$g(12)$, $9$ digits 2 weeks, 2 days ago
3
mmtg
$g(11)$, $8$ digits 2 weeks, 2 days ago
4
mmtg
$g(10)$, $8$ digits 2 weeks, 2 days ago
5
mmtg
$g(9)$, $7$ digits 2 weeks, 2 days ago