Euler's φ-function measures the number of positive integers equal to or less than n,

which are relatively prime to n.

Compute the following:

∑ φ(d)

d|n

Prove this is correct.

The only observation I've made so far is that this must be a multiplicative function.