Let $d(k)$ be the sum of all divisors of $k$. We define the function $S(N) = \sum_{i=1}^N \sum_{j=1}^Nd(i \cdot j)$. For example, $S(3) = d(1) + d(2)...
Julie proposes the following wager to her sister Louise. She suggests they play a game of chance to determine who will wash the dishes. For this game,...
Recall that a graph is a collection of vertices and edges connecting the vertices, and that two vertices connected by an edge are called adjacent. Graphs can...
Let $E(x_0, y_0)$ be the number of steps it takes to determine the greatest common divisor of $x_0$ and $y_0$ with Euclid’s algorithm. More formally:$x_1 = y_0$,...
Let $S(n,m) = \sum\phi(n \times i)$ for $1 \leq i \leq m$. ($\phi$ is Euler’s totient function) You are given that $S(510510,10^6)= 45480596821125120$. Find $S(510510,10^{11})$. Give the...
Fred the farmer arranges to have a new storage silo installed on his farm and having an obsession for all things square he is absolutely devastated when...