For x to be such a number is equivalent to x being an kth root of unity for some k up to 2012. For each k, there are \varphi(k)primitivek^{\text {th }}rootsofunity,sothetotalnumberofrootsis∑k=12012φ(k). We will give a good approximation of this number using well known facts about the Möbius function, defined by \mu(n)=\left\{0(−1)r if n is not squarefree if n has r distinct prime factors. \right..Itturnsoutthatiff(n)=\sum_{d \mid n} g(d),theng(n)=\sum_{d \mid n} \mu(d) f\left(\frac{n}{d}\right).Usingthisfact,sincen=\sum_{d \mid n} \varphi(d),wehavethatφ(n)=∑d∣nμ(d)dn. Now we have reduced the problem to estimating \sum_{k=1}^{2012} \sum_{d \mid k} \mu(d) \frac{k}{d}.Leta=\frac{k}{d},soweobtain∑k=12012∑d∣kaμ(d). We can interchange the order of summation by writing d=1∑2012a=1∑⌊d2012⌋aμ(d)≈d=1∑2012μ(d)21(⌊d2012⌋)2≈d=1∑2012μ(d)2d220122=220122d=1∑2012d2μ(d)≈220122d=1∑∞d2μ(d) The Möbius function also satisfies the property that \sum_{d \mid n} \mu(d)=\left\{10 if n=1 otherwise \right.,whichcanbeseenasaspecialcaseofthetheoremabove(lettingf(n)=1, g(n)=\left\{10 if n=1 otherwise \right.).Wecanthenseethat(∑d=1∞d2μ(d))(∑c=1∞c21)=121=1, so \sum_{d=1}^{\infty} \frac{\mu(d)}{d^{2}}=\frac{6}{\pi^{2}}.Therefore,wehave∑k=12012φ(k)≈π23⋅20122= 1230488.266... 2012 is large enough that all of our approximations are pretty accurate and we should be comfortable perturbing this estimate by a small factor to give bounding values.