Gcd Sum

$G(N)=\sum_{j=1}^N\sum_{i=1}^j \gcd(i,j)$. You are given: $G(10)=122$. Find $G(10^{11})$. Give your answer modulo $998244353$. The computation of G(10^11) would be extremely cumbersome to compute directly, it would involve...

Lambda Count

The lambda-calculus is a universal model of computation at the core of functional programming languages. It is based on lambda-terms, a minimal programming language featuring only function...