Related papers: Two elementary formulae and some complicated prope…
Let $K$ be a field and let $S=\bigoplus_{n\geq 0} S_n$ be a positively graded $K$-algebra. Given $M=\bigoplus_{n\geq 0} M_n$, a finitely generated graded $S$-module, and $w>0$, we introduce the function $\zeta_M(z,w):=…
An elementary approach for computing the values at negative integers of the Riemann zeta function is presented. The approach is based on a new method for ordering the integers and a new method for summation of divergent series. We show that…
The basic mathematical properties of Green's functions used in statistical mechanics as well as the equations defining these functions and the techniques of solving these equations are reviewed. An approach is presented called the…
A real arithmetic function f is multiplicatively monotonous if f (mn) -- f (m) has constant sign for m, n positive integers. Properties and examples of such functions are discussed, with applications to positive hermitian…
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…
A Master equation has been previously obtained which allows the analytic integration of a fairly large family of functions provided that they possess simple properties. Here, the properties of this Master equation are explored, by extending…
We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…
Erdos and Niven proved that for any positive integers $m$ and $d$, there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1/m,1/(m+d), ..., 1/(m+nd)$ are integers. Recently, Chen…
Let $\zeta(.)$ denote the Riemann zeta function and let $a(.)$ and $A(.)$ respectively denote a multiplicative function and its corresponding summatory function. We consider the correlation $$ \langle a(n)A(n-1) \rangle (T) =…
Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…
We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…
We present a simplified integral of functions of several variables. Although less general than the Riemann integral, most functions of practical interest are still integrable. On the other hand, the basic integral theorems can be obtained…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
We prove a Jensen formula for slice-regular functions of one quaternionic variable. The formula relates the value of the function and of its first two derivatives at a point with its integral mean on a three dimensional sphere centred at…
It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…
This paper offers two elementary yet precise derivations of an exact formula \[ W(n) = \sum_{i=1} ^{n} \lceil \lg i \rceil = n \lceil \lg n \rceil - 2^{\lceil \lg n \rceil} + 1 \] for the maximum number $ W(n) $ of comparisons of keys…
We give an efficient quantum algorithm for the Moebius function $\mu(n)$ from the natural numbers to $\{-1,0,1\}$. The cost of the algorithm is asymptotically quadratic in $\log n$ and does not require the computation of the prime…
We consider iterations of integer-valued functions $\phi$, which have no fixed points in the domain of positive integers. We define a local function $\phi_n$, which is a sub-function of $\phi$ being restricted to the subdomain $\{0, ..., n…
We present highlights of computations of the Riemann zeta function around large values and high zeros. The main new ingredient in these computations is an implementation of the second author's fast algorithm for numerically evaluating…
Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…