Related papers: Computation of the Totient Summatory Function

We propose an $\widetilde{O}(n + 1/\eps)$-time FPTAS (Fully Polynomial-Time Approximation Scheme) for the classical Partition problem. This is the best possible (up to a polylogarithmic factor) assuming SETH (Strong Exponential Time…

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

We study a general class of multiplicative functions by relating "short averages" to its "long average". More precisely, we estimate asymptotically the variance of such a class of functions in short intervals using Fourier analysis and…

Finding the mean square averages of the Dirichlet $L$-functions over Dirichlet characters $\chi$ of same parity is an active problem in number theory. Here we explicitly evaluate such averages of $L(3,\chi)$ and $L(4,\chi)$ using certain…

In this paper we give a polynomial time algorithm to compute $\varphi(N)$ for an RSA module $N$ using as input the order modulo $N$ of a randomly chosen integer. This provides a new insight in the very important problem of factoring an RSA…

We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of $n \le x$ for which the Alladi-Erd\H{o}s function $A(n) =…

Let $f(n)$ be an arithmetic function with $f(n) \ll n^\alpha$ for some $\alpha\in[0,1)$ and let $\lfloor .\rfloor $ denote the integer part function. In this paper, we evaluate asymptotically the sums $$\sum_{n_{1}n_{2}\leq x}f \left(…

Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…

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) =…

We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…

We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…

We give a closed-form expression for $\varphi(1+\varphi(2+\varphi(3+...+\varphi(n)$, where $\varphi$ is Euler's totient function. More generally, for an integer sequence $A=\{a_j\}$ we study the value of…

This is a discussion of miscellaneous summation, integration and transformation formulas obtained using Fourier analysis. The topics covered are: Series of the form $\sum_{n\in\mathbb{Z}} c_ne^{\pi i \gamma n^2}$; Fusion of integrals, and…

We obtain almost sure bounds for the weighted sum $\sum_{n \leq t} \frac{f(n)}{\sqrt{n}}$, where $f(n)$ is a Steinhaus random multiplicative function. Specifically, we obtain the bounds predicted by exponentiating the law of the iterated…

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…

We prove that $$ \sum_{n \leq x} \varphi([x/n])\leq\bigg(\frac{1380}{4009}+\frac{2629}{4009}\cdot\frac1{\zeta(2)}+o(1)\bigg)x\log x $$ as $x\to\infty$, where $\varphi$ denotes the Euler totient function and $[x]$ denotes the integer part of…

In this article we calculate the Hausdorff dimension of the set \begin{equation*} \mathcal{F}(\Phi )=\left\{ x\in \lbrack 0,1):\begin{aligned}a_{n+1}(x)a_n(x) \geq \Phi(n) \ {\rm for \ infinitely \ many \ } n\in \mathbb N \ {\rm and } \\…

We define $\overline{\psi}$ to be the multiplicative arithemtic function that satisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), & \mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for all primes $p$…

Walfisz (1963) proved the asymptotic formula \[ \sum_{n\le x}\varphi(n) = \frac{3}{\pi^2}x^2+O(x(\log x)^{\frac{2}{3}}(\log\log x)^{\frac{4}{3}}), \] which improved the error term estimate of Mertens (1874) and had been the best possible…

This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…