Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

When I tested this in Mathematica, I had expected it to say it did not converge. However, I got this:

$$\prod_{n=1}^{\infty} n{}^{\mu(n)}=\frac{1}{4 \pi ^2}$$

This indicates there is a slight skew toward the square-free numbers that have an odd number of factors.

I haven't been able to find this in the literature, but my guess is that it is already known.

Can someone point me in the right direction?

Edit: We have been told it is a bug.

Edit 2 We can make this work by creating a function $f(k)$ that returns the $k$-th square-free number (in the constructive? order). We can find a few ideas from A019565.



At the steps when $n>2$ is a power of $2$, sum$=0$ and prod$=1$.
Also, at those steps, $f(n)$ is the primorial with $p_{k}$ as the greatest factor, with $k=\frac{\text{log}(n)}{\text{log}(2)}$

Edit 3
Instead of changing the sequence (as in Edit 2), we can try this: With $\epsilon = 1. \times 10^{-7}\text{ or smaller}$ $$ \sum _{n=1}^{\infty } \frac{\mu(n)+\epsilon }{n^s}/\prod _{n=1}^{\infty } n^{\mu(n)\epsilon } \equiv \frac{1}{\zeta(s)}\pm\epsilon $$

The $\sum / \prod$ work in tandem to remove the wheat from the chaff.

When $s=0$, we get $-2\pm\epsilon$, though Mathematica complains about it. fixed below

Edit 3a
Removed the generating function because $(2 \pi )^{2 \epsilon }$ could be any positive number. I have no more questions.

share|improve this question
There's no way this product can converge, as its terms don't tend to 1. Goodness knows what Mathematica is trying to say with its "evaluation" of the product. –  David Loeffler Mar 12 '13 at 12:08
I have posted at mathematica.stackexchange.com/q/21149/973 to get some info on whether this is correct or not. –  Fred Kline Mar 12 '13 at 12:34
Doesn't Mathematica also silently apply summation methods to divergent series as well? Why declare this a bug, but not all of those? –  Gerald Edgar Mar 12 '13 at 17:07
@Gerlad Edgar: the edit seems like a consequence of the follwing comment on mathematica.SE "I'm told it's a bug and will be treated as such. – Daniel Lichtblau". –  quid Mar 12 '13 at 18:50
In its current state, I don't see where there's a question. –  Gerry Myerson Mar 26 '13 at 11:29
add comment

3 Answers

up vote 14 down vote accepted

So of course it does not converge. The behavior is interesting however. Below is the graph of the $\log$ of the product going up to $5000.$ There can be runs very rich in square free integers with an even number of divisors which cause a dramatic shift. AT $509$ the product is about $5\times 10^{-13}.$ Of the next $45$ square free integers ,$15$ provide a factor around $\frac{1}{500}$ and the other $30$ provide a factor around $500$ so the product at $586$ is around $1.7 \times 10^{23}.$ Of course there are bigger swings in both directions later on. This argues against any simply minded convergence acceleration used as smoothing.

Rearranging can do anything but a reasonable procedure might be to look at the $2^k$ square free integers divisible only by (some) of the first $k$ primes. The product over those comes out to be $1$ for $p_k \ge 3.$ So this could be taken as suggesting some balance. As far as $10000$ the product never has an even denominator after $5$. However the numerator is just four times an odd number for $6590,6593$ so if forced to guess I'd guess thatit is negative someplace(s) past $10000.$ Something similar seems to be happening with larger small primes.

alt text

share|improve this answer
add comment

We have $$\frac{1}{\zeta(s)} = \sum_{n=1}^{\infty} \frac{\mu(n)}{n^s} \quad \mbox{for} \ Re(s)>1.$$ Taking the derivative with respect to $s$, we get the following $$- \frac{\zeta'(s)}{\zeta(s)^2} = - \sum_{n=1}^{\infty} (\log n) \frac{\mu(n)}{n^s} \quad \mbox{for} \ Re(s)>1.$$

If we plug in $s=0$ to the second equation (which is not allowed, because the second equation is only valid for $Re(s)>1$) we get $$ - \frac{\zeta'(0)}{\zeta(0)^2} = - \sum_{n=1}^{\infty} \mu(n) \log(n) \quad \mbox{(FALSE EQUATION)}.$$

We have $$\zeta(0) = - \frac{1}{2} \quad \zeta'(0) = - \frac{1}{2} \log(2 \pi)$$ so $$ - \frac{\zeta'(0)}{\zeta(0)^2} = 2 \log(2 \pi)$$

So, if we believed the false equation, we would have $$\sum_{n=1}^{\infty} \mu(n) \log(n) = -2 \log (2 \pi) \ \mbox{and} \ \prod_{n=1}^{\infty} n^{\mu(n)} = \frac{1}{4 \pi^2}.$$

I don't know why Mathematica thinks it's okay to plug in $s=0$.

share|improve this answer
@Speyer: "I don't know why Mathematica thinks it's okay to plug in $s=0$." Secretly Mathematica is a physicist? –  Jason Starr Mar 12 '13 at 15:18
Well we expect the formula for $-\zeta'/\zeta^2$ to hold for ${\rm Re}(s) > 1/2$... But certainly not for $s=0$. –  Noam D. Elkies Mar 12 '13 at 15:20
One way to regularize $\sum_{n=1}^N f(n)$ is (from terrytao.wordpress.com/2010/04/10) by taking a cutoff function $\eta$ with compact support satisfying $\eta(0) = 1$, and using $\sum_{n=1}^\infty \eta(n/N) f(n)$. For $\eta = \chi_{[0,1]}$, you get the ordinary sum, and for $\eta(x) = (1-x)\chi_{[0,1]}$ you get Cesáro. If you want a good asymptotic expansion, $\eta$ should be smooth, or else boundary effects crop up. At any rate, you get your value of $2 \log(2\pi)$ plus $\sum_\rho c_\rho N^\rho$ as $\rho$ varies over zeroes of $\zeta'$, which I don't know how to control. –  S. Carnahan Mar 13 '13 at 2:14
@quid: I see now that my argument is repeatative. I deleted all of it. Sorry. –  i707107 Mar 13 '13 at 5:21
Some earlier Cesaro sum data which I posted was wrong; I had a stupid programming error. –  David Speyer Mar 13 '13 at 12:56
show 5 more comments

This is a discussion following from David Speyer about Cesaro summability of the series. This series is not Cesaro summable in any order.

In "The General Theory of Dirichlet Series" by Hardy and Riesz. Chapter 4.

Let $\kappa\geq 0$. $0\leq \lambda _0<\lambda_1<\cdots<\lambda_n\rightarrow\infty$, and write $$ A_{\lambda}^{\kappa}(w) = \sum_{\lambda_n \textrm{<}w}(w-\lambda_n)^{\kappa}a_n. $$

\bf Summability $(\lambda,\kappa)$. \rm If $A_{\lambda}^{\kappa}(w)\sim Aw^{\kappa}$ as $w\rightarrow\infty$, then we say that $\sum a_n$ is summable $(\lambda,\kappa)$ to sum $A$.

The second consistency theorem(we do not need first consistency theorem here) states that If $\sum a_n$ is summable $(l,\kappa)$ where $l_n=e^{\lambda_n}$, then it is summable $(\lambda,\kappa)$ to the same sum. In particular, Cesaro summability of order $\kappa$ implies $(\log n, \kappa)$ summability to the same sum.

We consider the formula $$ \sum_{n=1}^{\infty}a_ne^{-\lambda_ns}=\frac{1}{\Gamma(\kappa+1)}\int_0^{\infty}s^{\kappa+1}e^{-s\tau}A_{\lambda}^{\kappa}(\tau)d\tau.$$

This is originally valid if $\sigma> max(0,\sigma_c)$ where $\sigma_c$ is the abscissa of convergence of the left series. On the other hand, the right allows an analytic continuation of the function represented by the series on the left up to $\sigma>0$.

What we use here is $a_n = \mu (n)\log n$ and $\lambda_n = \log n$ .

Hence, assuming Cesaro summability of any order $\kappa$, will allow $$-\frac{\zeta'(s)}{\zeta^2(s)}$$ to have an analytic continuation to $\sigma>0$ which contradicts the fact that $\zeta(s)$ has zeros on the critical line.

share|improve this answer
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.