English
Related papers

Related papers: Average Orders of the Euler Phi Function, The Dede…

200 papers

The Euler phi function on a given integer $n$ yields the number of positive integers less than $n$ that are relatively prime to $n$. Equivalently, it gives the order of the group of units in the quotient ring $\mathbb{Z}/(n)$. We generalize…

Number Theory · Mathematics 2021-08-10 Emily Gullerud , Aba Mbirika

Let $p \in (0, \infty)$ be a constant and let $\{\xi_n\} \subset L^p(\Omega, {\mathcal F}, \P)$ be a sequence of random variables. For any integers $m, n \ge 0$, denote $S_{m, n} = \sum_{k=m}^{m + n} \xi_k$. It is proved that, if there…

Probability · Mathematics 2010-12-21 Erkan Nane , Yimin Xiao , Aklilu Zeleke

The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…

Number Theory · Mathematics 2021-06-29 Subha Sarkar

We study Birkhoff sums over rotations (series of the form $\sum_{r=1}^{N}\phi(r\alpha)$), in which the summed function $\phi$ may be unbounded at the origin. Estimates of these sums have been of significant interest and application in pure…

Number Theory · Mathematics 2023-04-04 Paul Verschueren

For an integer $n \geq 1$, the Erd\H{o}s-Rogers function $f_{s}(n)$ is the maximum integer $m$ such that every $n$-vertex $K_{s+1}$-free graph has a $K_s$-free subgraph with $m$ vertices. It is known that for all $s \geq 3$, $f_{s}(n) =…

Combinatorics · Mathematics 2024-02-12 Dhruv Mubayi , Jacques Verstraete

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

Classical Analysis and ODEs · Mathematics 2023-01-06 Anatoly Serdyuk , Tetiana Stepaniuk

In this paper we introduce and study a family $\Phi_k$ of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation $\gcd(x_1^2+\ldots +x_k^2, n)=1$ with $x_1,\ldots,x_k…

Number Theory · Mathematics 2014-06-26 Catalina Calderon , Jose Maria Grau , A. Oller-Marcen , László Tóth

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

Number Theory · Mathematics 2021-02-10 Sungjin Kim

Let $d(n)$ be the divisor function and denote by $[t]$ the integral part of the real number $t$. In this paper, we prove that $$\sum_{n\leq x^{1/c}}d\left(\left[\frac{x}{n^c}\right]\right)=d_cx^{1/c}+\mathcal{O}_{\varepsilon,c}…

Number Theory · Mathematics 2025-05-06 Liuying Wu

We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) =…

Number Theory · Mathematics 2017-08-24 Gregory Debruyne , Jasson Vindas

We show that for some $k\le 3570$ and all $k$ with $442720643463713815200|k$, the equation $\phi(n)=\phi(n+k)$ has infinitely many solutions $n$, where $\phi$ is Euler's totient function. We also show that for a positive proportion of all…

Number Theory · Mathematics 2022-07-05 Kevin Ford

The generalized group of units of the ring modulo $n$ was first introduced by El-Kassar and Chehade, written as $U^k(Z_n)$. This allows us to formulate a new generalization to the Euler phi function $\varphi(n)$, that represents the order…

Number Theory · Mathematics 2021-11-29 Mohammad El-Hindi , Therrar Kadri

We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function,…

Number Theory · Mathematics 2016-12-30 László Tóth

Let $n=p_1^{\nu_1}... p_r^{\nu_r} >1$ be an integer. An integer $a$ is called regular (mod $n$) if there is an integer $x$ such that $a^2x\equiv a$ (mod $n$). Let $\varrho(n)$ denote the number of regular integers $a$ (mod $n$) such that…

Number Theory · Mathematics 2008-09-01 László Tóth

This paper concerns the values of the Euler phi-function evaluated simultaneously on k arithmetic progressions a_1 n + b_1, a_2 n + b_2, ..., a_k n + b_k. Assuming the necessary condition that no two of the polynomials a_i x + b_i are…

Number Theory · Mathematics 2007-05-23 Greg Martin

Let $f$ be a Steinhaus random multiplicative function, and for $\alpha\in \mathbb{R}$, let $d_\alpha$ denote the $\alpha$-divisor function. For $\alpha \in (1,2)$ we establish that $$ \mathbb{E}\bigg\{\Big|\frac{1}{\sqrt{x}}\sum_{n\leq x}…

Number Theory · Mathematics 2026-04-08 Jad Hamdan

Let $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]} \b n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot]$ is the greatest integer function. In the paper we present a summation formula and several congruences involving $\{U_n\}$.

Number Theory · Mathematics 2012-04-20 Zhi-Hong Sun

For a nonzero integer $a$ let ${E_n^{(a)}}$ be given by $\sum_{k=0}^{[n/2]}\binom n{2k}a^{2k}E_{n-2k}^{(a)}=(1-a)^n$ $(n=0,1,2,...)$, where $[x]$ is the greatest integer not exceeding $x$. As $E_n^{(1)}=E_n$ is the Euler number, $E_n^{(a)}$…

Number Theory · Mathematics 2013-07-16 Zhi-Hong Sun , Long Li

This article extends our previous study on the summatory behavior of Euler's totient function $\varphi(n)$. We investigate two complementary restricted sums, $\Upsilon(x,p)=\sum_{\substack{k\le x\\\gcd(k,p)=1}}\varphi(k)$ and…

General Mathematics · Mathematics 2025-09-10 Es-said En-naoui

Let $I(n):=\int_0^1 [x^n+(1-x)^n]^\frac1n dx.$ In this paper, we show that $I(n)= \sum_0^\infty \frac{I_i}{n^i},n\rightarrow \infty$ and we compute $I_i, i =0..5$, obtained by polylog functions and Euler sums. As a corollary, we obtain…

Combinatorics · Mathematics 2017-10-03 Guy Louchard