By simple elementary method,we obtain with ease,a highly simple expression for the remainder term of the divisor problem and use it to obtain an Euler-Maclaurin analogue of summation involving divisor function.We also obtain a relation connecting the remainder term of the divisor problem and the remainders of approximate functional equations for Riemann zeta function and its square,for positive values of arguments.
Let $x$ be a positive integer. We give an asymptotic result for $ω(\operatorname{lcm}(m,n))$ summed over all positive integers $m$ and $n$ with $mn \le x$. This answers an open question posed in a recent paper.
Euler--Maclaurin and Poisson analogues of the summations $\sum_{a < n \leq b} χ(n) f(n)$, $\sum_{a < n \leq b} d(n) f(n)$, $\sum_{a < n \leq b} d(n) χ(n) f(n)$ have been obtained in a unified manner, where $(χ(n))$ is a periodic complex sequence; $d(n)$ is the divisor function and $f(x)$ is a sufficiently smooth function on $[a,b]$. We also state a generalised Abel's summation formula, generalised Euler's summation formula and Euler's summation formula in several variables.
We study the distribution of divisors of Euler's totient function and Carmichael's function. In particular, we estimate how often the values of these functions have "dense" divisors.
The upper bound and the lower bound of average numbers of divisors of Euler Phi function and Carmichael Lambda function are obtained by Luca and Pomerance (see \cite{LP}). We improve the lower bound and provide a heuristic argument which suggests that the upper bound given by \cite{LP} is indeed close to the truth.
This paper presents a family of rapidly convergent summation formulas for various finite sums of analytic functions. These summation formulas are obtained by applying a series acceleration transformation involving Stirling numbers of the first kind to the asymptotic, but divergent, expressions for the corresponding sums coming from the Euler-Maclaurin summation formula. While it is well-known that the expressions obtained from the Euler-Maclaurin summation formula diverge, our summation formulas are all very rapidly convergent and thus computationally efficient.
The function $h^0$ for a number field is analogous to the dimension of the Riemann-Roch spaces at divisors on an algebraic curve. We provide a method to compute this function for number fields with unit group of rank at most 2, even with large discriminant. This method is based on using LLL-reduced bases, the "jump algorithm" and Poisson summation formula.
We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $ϕ(n)$ and the sum-of-proper-divisors function $s(n):=σ(n)-n$. We prove that the values $ϕ(n)$, for $n\le x$, that are coprime to $p$ are asymptotically uniformly distributed among the $p-1$ coprime residue classes modulo $p$, uniformly for $5 \le p \le (\log{x})^A$ (with $A$ fixed but arbitrary). We also show that the values of $s(n)$, for $n$ composite, are uniformly distributed among all $p$ residue classes modulo every $p\le (\log{x})^A$. These appear to be the first results of their kind where th…
We study the behavior of zero-divisors of the double zeta-function $ζ_2(s_1,s_2)$. In our former paper \cite{MatSho14} we studied the case $s_1=s_2$, but in the present paper we consider the more general two variable situation. We carry out numerical computations in order to trace the behavior of zero-divisors. We observe that some divisors approach the points with $s_2=0$, while other divisors approach the points which are solutions of $ζ(s_2)=1$.
We discuss two theorems in analytic number theory and combinatory analysis that have seen increased use in recent years. A corollary to a Tauberian theorem of Ingham allows one to quickly prove asymptotic formulas for arithmetic sequences, so long as the corresponding generating function exhibits exponential growth of a certain form near its radius of convergence. Two common methods for proving the required analytic behavior are modular transformations and Euler-Maclaurin summation. However, these results are sometimes stated without certain technical conditions that are necessary for the comp…
We obtain asymptotics with a power saving error term for $\int_0^1|\sum_{n\le X} d(n)e(nα)|^sdα$ for $s < 2$, where $d(n) = \sum_{d | n} 1$ is the divisor function. We also obtain such asymptotics for $\int_0^1|\sum_{n\le X}λ_f(n)e(nα)|^sdα$ for all $s > 0$. Our proof an iterative method with repeated applications of Jutila's variant of the circle method and Voronoi summation.
We obtain several asymptotic formulas for the sum of the divisor function $τ(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x^{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x^{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 0$. Our method builds on an approach due to Blomer (2008) …
Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and triangular numbers.
The Apostol-Dedekind sum with quasi-periodic Euler functions is an analogue of Apostol's definition of the generalized Dedekind sum with periodic Bernoulli functions. In this paper, using the Boole summation formula, we shall obtain the reciprocity formula for this sum.
We provide a multidimensional weighted Euler--MacLaurin summation formula on polytopes and a multidimensional generalization of a result due to L. J. Mordell on the series expansion in Bernoulli polynomials. These results are consequences of a more general series expansion; namely, if $χ_{τ\mathcal{P}}$ denotes the characteristic function of a dilated integer convex polytope $\mathcal{P}$ and $q$ is a function with suitable regularity, we prove that the periodization of $qχ_{τ\mathcal{P}}$ admits an expansion in terms of multivariate Bernoulli polynomials. These multivariate polynomials are re…
In this article, we study a divisor function in an arbitrary number field akin to Koshliakov's work on Vorono\"{\dotlessi} summation formula. More precisely, we generalize Koshliakov's kernel and Koshliakov's transform over any number field to obtain identities for the Lambert series associated to the divisor function in an arbitrary number field.
In the sixth chapter of his notebooks Ramanujan introduced a method of summing divergent series which assigns to the series the value of the associated Euler-MacLaurin constant that arises by applying the Euler-MacLaurin summation formula to the partial sums of the series. This method is now called the Ramanujan summation process. In this paper we calculate the Ramanujan sum of the exponential generating functions $\sum_{n\geq 1}\log n e^{nz}$ and $\sum_{n\geq 1}H_n^{(j)} e^{-nz}$ where $H_n^{(j)}=\sum_{m=1}^n \frac{1}{m^j}$. We find a surprising relation between the two sums when $j=1$ from w…
Translation from the Latin of Euler's "Demonstratio theorematis circa ordinem in summis divisorum observatum" (1760). E244 in the Enestroem index. In his previous paper E243, Euler stated the pentagonal number theorem and assuming it proved a recurrence relation for the sum of divisors function. In E244 Euler proves the pentagonal number theorem, and then repeats the proof of the recurrence. In Proposition 1, Euler proves that $\prod_{n=1}^\infty (1-a_n)=1-\sum_{n=1}^\infty a_n(1-a_1)...(1-a_{n-1})$. In Proposition 2 he explicitly states the case $a_n=x^n$. Then in Proposition 3, Euler applies…
Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that the alternating sum of the reciprocal odd numbers is exactly $π/4$. This competition came to be known as the Basel Problem, and Euler's approximation probably spurred his spectacular solution in the same year. Subsequently he connected his summation formula to Bernoulli numbers, and applied it to many other topics, masterfully circumventing that it almost a…
We have established novel integral representations of the Riemann zeta-function and Dirichlet eta-function based on powers of trigonometric functions and digamma function, and then use these representations to find close forms of Laurent series expansions of these same powers of trigonometric functions and digamma function. The so obtained series can be used to find numerous summation rules for certain values of the Riemann zeta and related functions and numbers, such as e.g. Bernoulli and Euler numbers.
We compute the first and second moments of the divisor-counting function for the Euler-Poincaré characteristic and the trace of Frobenius for the reductions modulo $p$ of a rank 2 Drinfeld module with nontrivial endomorphism ring, as the prime $p$ varies over the primes of ordinary reduction of the Drinfeld module. From these moments we derive the normal order of the number of prime divisors of these invariants.
In this paper we study the mean values of some multiplicative functions connected with the divisor function on the short interval of summation. The asymptocic values for such mean values are proved.
In this note, we provide refined estimates of the following sums involving the Euler totient function: $$\sum_{n\le x} ϕ\left(\left[\frac{x}{n}\right]\right) \qquad \text{and} \qquad \sum_{n\le x} \frac{ϕ([x/n])}{[x/n]}$$ where $[x]$ denotes the integral part of real $x$. The above summations were recently considered by Bordellès et al. and Wu.
In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive prime divisors and representations of some related Euler products. Moreover, we sum functions over all primitive divisors of a Fibonacci number and obtain a non--trivial fixed point of this operation.
An elliptic $BC_n$ generalization of the classical two parameter Bailey Lemma is proved, and a basic one parameter $BC_n$ Bailey Lemma is obtained as a limiting case. Several summation and transformation formulas associated with the root system $BC_n$ are proved as applications, including a $_6ϕ_5$ summation formula, a generalized Watson transformation and an unspecialized Rogers--Selberg identity. The last identity is specialized to give an infinite family of multilateral Rogers--Selberg identities. Standard determinant evaluations are then used to compute $B_n$ and $D_n$ generalizations of t…
Euler states without proof statements about the form of prime divisors of numbers of the form aa+Nbb. See Ed Sandifer's How Euler Did It, ``Factors of Forms'', December 2005 at http://www.maa.org/news/howeulerdidit.html for a summary of the paper.
Translation from the Latin of Euler's "Observatio de summis divisorum" (1752). E243 in the Enestroem index. The pentagonal number theorem is that $\prod_{n=1}^\infty (1-x^n)=\sum_{n=-\infty}^\infty (-1)^n x^{n(3n-1)/2}$. This paper assumes the pentagonal number theorem and uses it to prove a recurrence relation for the sum of divisors function. The term "pentagonal numbers" comes from polygonal numbers. Euler takes the logarithmic derivative of both sides. Then after multiplying both sides by $-x$, the left side is equal to $\sum_{n=1}^\infty σ(n) x^n$, where $σ(n)$ is the sum of the divisors …
In this paper, we confirm a smoothed version of a recent conjecture on the variance of the k-fold divisor function in arithmetic progressions to individual composite moduli, in a restricted range. In contrast to a previous result of Rodgers and Soundararajan, we do not require averaging over the moduli. Our proof adapts a technique of S. Lester who treated in the same range the variance of the k-fold divisor function in the short intervals setting, and is based on a smoothed Voronoi summation formula but twisted by multiplicative characters. The use of Dirichlet characters allows us to extend …
Adapting a technique of Pintz, we give an elementary demonstration of the Deuring phenomenon: a zero of ζ(s) off the critical line gives a lower bound on L(1,χ). The necessary tools are Dirichlet's 'method of the hyperbola', Euler summation, summation by parts, and the Polya-Vinogradov inequality.
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the prime factors of the argument, the explicit form of which is proven in this paper. Subsequently it is shown how the procedure can be generalized to the discrete Fourier transform of a function of the greatest common divisor. From this representation some interesting relations concerning the Euler totient function and generalizations thereof are established.
In this paper we present a generalization of Faulhaber's formula to sums of arbitrary complex powers $m\in\mathbb{C}$. These summation formulas for sums of the form $\sum_{k=1}^{\lfloor x\rfloor}k^{m}$ and $\sum_{k=1}^{n}k^{m}$, where $x\in\mathbb{R}^{+}$ and $n\in\mathbb{N}$, are based on a series acceleration involving Stirling numbers of the first kind. While it is well-known that the corresponding expressions obtained from the Euler-Maclaurin summation formula diverge, our summation formulas are all very rapidly convergent.
If $N = {q^k}{n^2}$ is an odd perfect number, where $q$ is the Euler prime, then we show that $n < q$ is sufficient for Sorli's conjecture that $k = ν_{q}(N) = 1$ to hold. We also prove that $q^k < 2/3{n^2}$, and that $I(q^k) < I(n)$, where $I(x)$ is the abundancy index of $x$.
The main aim of this paper is to study an analogue of the generalized divisor function in a number field $\mathbb{K}$, namely, $σ_{\mathbb{K},α}(n)$. The Dirichlet series associated to this function is $ζ_{\mathbb{K}}(s)ζ_{\mathbb{K}}(s-α)$. We give an expression for the Riesz sum associated to $σ_{\mathbb{K},α}(n),$ and also extend the validity of this formula by using convergence theorems. As a special case, when $\mathbb{K}=\mathbb{Q}$, the Riesz sum formula for the generalized divisor function is obtained, which, in turn, for $α=0$, gives the Vorono\"ı summation formula associated to the d…
We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $σ_A(n)= \sum_{d\in A(n)} d$, where A(n) is a subset of the set of all positive divisors of $n$, including the divisor-sum function $σ(n)$ and its unitary and exponential analogues. We also give the minimal order of a new class of Euler-type functions, including the Euler-function $ϕ(n)$ and its unitary analogue.
In the present article, we study Bell based Euler polynomial of order α and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind. Moreover, we drive several important formulae of bell based Euler polynomial by using umbral calculus.
Using basic hypergeometric functions and partial fraction decomposition we give a new kind of generalization of identities due to Uchimura, Dilcher, Van Hamme, Prodinger, and Chen-Fu related to divisor functions. An identity relating Lambert series to Eulerian polynomials is also proved.
The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with Ramanujan's sum, and on the other hand it can be written as a generalised convolution product of the identity with the totient function. We show that this arithmetic function of two integers (a,m) counts the number of elements in the set of ordered pairs (i,j) such that i*j is equivalent to a modulo m. Furthermore we generalise a dozen known identities for the toti…
In this paper, we show that Riemann hypothesis (concerning zeros of the zeta function in the critical strip) is equivalent to the analytic continuation of Euler products obtained by restricting the Euler zeta product to suitable subsets $M_k$, $k\geq 1$ of the set of prime numbers. Each of these Euler product defines so a partial zeta function $ζ_{k}(s)$ equal to a Dirichlet series of the form $\sum ε(n)/n^s$, with coefficients $ε(n)$ equal to 0 or 1 as n belongs or not to the population of integers generated by $M_k$. We show that usual formulas of the arithmetic adapt themselves to such popu…
In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $φ$, Dedekind function $Ψ$, sum-of-divisors function $σ$ or the alternating sum-of-divisors function $β.$ We improve previous results when $f=φ$ and derive new estimates when $f=Ψ, f=σ$ and $f=β.$
Motivated by studies in accelerator physics this paper computes the asymptotic behavior of the series $\displaystyle \sum_{k=1}^N φ(k) I_N\left(\frac{1}{k}\right)$, where $φ(k)$ is Euler's Totient function and $\displaystyle I_N\left(\frac{1}{k}\right)$ is the position that $1/k$ occupies in the Farey sequence of order $N$. To this end an exact formula for $\displaystyle I_N\left(\frac{1}{k}\right)$ is derived when all integers in $\displaystyle \left[2,\left\lceil \frac{N}{k} \right\rceil\right]$ are divisors of $N$.
