相关论文: Numerical Computation of \prod_{n=1}^\infty (1 - t…

Let $f : \{0,1\}^n \times \{0,1\}^n \rightarrow \{0,1\}$ be a 2-party function. For every product distribution $\mu$ on $\{0,1\}^n \times \{0,1\}^n$, we show that $$\mathsf{CC}^\mu_{0.49}(f) = O\left(\left(\log \mathsf{prt}_{1/8}(f) \cdot…

The function $\inf_n nx^{1/n}$ has the asymptotics $eu+e d^2(u)/(2u)+O(1/u^2)$ as $x\to\infty$, where $u=\log x$ and $d(u)$ is the distance from $u$ to the nearest integer. We generalize this observation. First, the curves $y=nx^{1/n}$ can…

Several infinite products are studied that satisfy the transformation relation of the type $f(\alpha)=f(1/\alpha)$. For certain values of the parameters these infinite products reduce to modular forms. Finite counterparts of these infinite…

It is known by a formula of Hasse-Sondow that the Riemann zeta function is given, for any $ s=\sigma+it \in \mathbb{C}$, by $ \sum_{n=0}^{\infty} \widetilde{A}(n,s)$ where $$ \widetilde{A}(n,s):=\frac{1}{2^{n+1}(1-2^{1-s})} \sum_{k=0}^n…

We propose a lower estimation for computing quantity of the inverses of Euler's function. We answer the question about the multiplicity of $m$ in the equation $\varphi(x) = m$ \cite{Ford}. An analytic expression for exact multiplicity of $m…

In this paper, we improve the usual relative error bound for the computation of x^n through iterated multiplications by x in binary floating-point arithmetic. The obtained error bound is only slightly better than the usual one, but it is…

We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…

As was initially shown by Brent, exponentials of truncated power series can be computed using a constant number of polynomial multiplications. This note gives a relatively simple algorithm with a low constant factor.

Approximating a definite integral of product of cosines to within an accuracy of n binary digits where the integrand depends on input integers x[k] given in binary radix, is equivalent to counting the number of equal-sum partitions of the…

Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…

In this paper, we give a short elementary proof of the well known Euler's recurrence formula for the Riemann zeta function at positive even integers and integral representations of the Riemann zeta function at positive integers and at…

The values of the partition function, and more generally the Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given by Ahlgren and Ono for the partition function and by Treneer for more general…

The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…

In this article, we study the convergence behaviour of the classical generalized Max Product exponential sampling series in the weighted space of log-uniformly continuous and bounded functions. We derive basic convergence results for both…

We provide a number of conditions on the rational numbers $u$ and $v$ which ensure that the Laurent series $g_{u,v}(x):=\prod_{t=0}^\infty (1+ux^{-3^t} + vx^{-2\cdot 3^t})$ is badly approximable.

Two quadrature-based algorithms for computing the matrix fractional power $A^\alpha$ are presented in this paper. These algorithms are based on the double exponential (DE) formula, which is well-known for its effectiveness in computing…

Here we study problems related to the proportions of zeros, especially simple and distinct zeros on the critical line, of Dedekind zeta functions. We obtain new bounds on a counting function that measures the discrepancy of the zeta…

The functional determinant multiplicative anomaly, or defect, is more closely investigated and explicit forms for products of linear operators are produced. I also present formulae for the defect of products of second order operators in…

A large-scale experiment was conducted to find formulas relating to the base $e^\pi$. The numbers in this base are $$x = \sum_{n=0}^\infty {a(n)\over e^{\pi n}}$$ where $a(n)$ is taken from the OEIS catalog. These experiments were inspired…

We expand on the remark by Andrews on the importance of infinite sums and products in combinatorics. Let $\{g_d(n)\}_{d\geq 0,n \geq 1}$ be the double sequences $\sigma_d(n)= \sum_{\ell \mid n} \ell^d$ or $\psi_d(n)= n^d$. We associate…