Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I only recently heard about the concept of $\zeta$-regularization, which allows the evaluation of things like

$$\infty != \prod_{k=1}^\infty k = \sqrt{2\pi}$$


$$\infty \# = \prod_{k=1}^\infty p_k = 4\pi^2$$

where $n\#$ is a primorial, and $p_k$ is the $k$-th prime. (The expression for the infinite product of primes is proven here.) That got me wondering if, given a sequence of positive integers $m_k$ (e.g. the Fibonacci numbers or the central binomial coefficients), it is always possible to evaluate the infinite product

$$\prod_{k=1}^\infty m_k$$

in the $\zeta$-regularized sense. It would seem that this would require studying the convergence and the possibility of analytically continuing the corresponding Dirichlet series, but I am not too well-versed at these things. If such a regularization is not always possible, what restrictions should be imposed on the $m_k$ for a regularized product to exist?

I'd love to read up on references for this subject. Thank you!

share|cite|improve this question
How did you get $\prod k =\sqrt{2\pi}$? – Fabian Aug 2 '12 at 9:54
@Fabian, if $\zeta^\prime(s)=-\sum\limits_{j=1}^\infty \frac{\log\,k}{k^s}$, then consider $\exp(-\zeta^\prime(0))$... – Timmy Turner Aug 2 '12 at 9:57
a free online preprint about the second equation is at (2013-05-13) – Gottfried Helms May 13 '13 at 17:50
I don't know if it helps or if it is obvious, but via exponentiation the problem is exactly the same as a classic series. – geodude Aug 24 '13 at 11:31
It seems to me that a physical interpretation of regularization would be to "measure" an object as it passes through the entrance to a black hole at a velocity asymptotically approaching the speed of light. – frogfanitw Jan 20 at 5:12

Your Answer


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

Browse other questions tagged or ask your own question.