Let $ϕ(n)$ be the Euler-phi function, define $ϕ_0(n) = n$ and $ϕ_{k+1}(n)=ϕ(ϕ_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $ϕ_k(n)$ is $y$-smooth, conditionally on a weak form of the Elliott-Halberstam conjecture.
Let phi denote Euler's phi function. For a fixed odd prime we give an asymptotic series expansion in the sense of Poincare for the number E_q(x) of n<=x such that q does not divide phi(n). Thereby we improve on a recent theorem of B.K. Spearman and K.S. Williams [Ark. Mat. 44 (2006), 166-181]. Furthermore we resolve, under the Generalized Riemann Hypothesis, which of two approximations to E_q(x) is asymptotically superior using recent results of Y. Ihara on the Euler-Kronecker constant of a number field.
For a fixed odd prime q we investigate the first and second order terms of the asymptotic series expansion for the number of n\le x such that q does not divide phi(n). Part of the analysis involves a careful study of the Euler-Kronecker constants for cyclotomic fields. In particular, we show that the prime k-tuples conjecture and a conjecture of Ihara about the distribution of these Euler-Kronecker constants cannot be both true.
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 constant multiples of each other, we show that there are infinitely many integers n for which phi(a_1 n + b_1) > phi(a_2 n + b_2) > ... > phi(a_k n + b_k). In particular, there exist infinitely many strings of k consecutive integers whose phi-values are arranged from largest to smallest in any prescribed manner. Also, under the necessary condition ad \ne bc, any …
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 $φ(n)$, that represents the order of $% U^k(Z_n)$ and it is denoted by $φ^{k}(n).$ In this paper, we introduce this newly defined function, where we compute its explicit form and examine some of its properties similar to that of $φ(n)$. In addition, we study some generalized equations involving $φ^{k}(n)$ where complete solution is given for some equations by considering the general case and others…
Let $φ$ be the Euler's function and fix an integer $k\ge 0$. We show that, for every initial value $x_1\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+1}=φ(x_n)+k$ for all $n\ge 1$ is eventually periodic. Similarly, for every initial value $x_1,x_2\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+2}=φ(x_{n+1})+φ(x_n)+k$ for all $n\ge 1$ is eventually periodic, provided that $k$ is even.
A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and asymptotic estimates are obtained for both functions.
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 the Euler phi function to the Eisenstein integer ring $\mathbb{Z}[ρ]$ where $ρ$ is the primitive third root of unity $e^{2πi/3}$ by finding the order of the group of units in the ring $\mathbb{Z}[ρ]/(θ)$ for any given Eisenstein integer $θ$. As one application we investigate a sufficiency criterion for when certain unit groups $\left(\mathbb{Z}[ρ]/(γ^n)\rig…
We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x(log x)^{-1+o(1)} numbers not exceeding x common to the ranges of Euler's function phi(n) and the sum-of-divisors function sigma(m).
Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges according to the action of phi. The absolute Galois group of K acts on T by tree automorphisms, giving a subgroup G(phi) of the group Aut(T) of all tree automorphisms. Beginning in the 1980s with work of Odoni, and developing especially over the past decade, a significant body of work has emerged on the size and structure of this Galois representation. These inquiries arose in part because knowledge of G(p…
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.
We show that the equation phi(a)=σ(b) has infinitely many solutions, where phi is Euler's totient function and sigma is the sum-of-divisors function. This proves a 50-year old conjecture of Erdos. Moreover, we show that there are infinitely many integers n such that phi(a)=n and sigma(b)=n each have more than n^c solutions, for some c>0. The proofs rely on the recent work of the first two authors and Konyagin on the distribution of primes p for which a given prime divides some iterate of phi at p, and on a result of Heath-Brown connecting the possible existence of Siegel zeros with the distrib…
We say that the order of an algebraic number $A$ is the minimum of positive integers $k$ such that $A^k$ is rational. In this paper, we show that the number of algebraic numbers $A$ with order $k$ such that \[ A,\ A^A,\ A^{A^A},\ \ldots \] converges to an algebraic number is approximated by $(e-1/e)φ(k)$. Here $φ(k)$ denotes Euler's totient function.
Let phi(n) be Euler's totient function and let sigma(n) be the sum of the positive divisors of n. We show that most phi-values (integers in the range of phi) are not sigma-values and vice versa.
We present an algorithm to invert the Euler function $ϕ(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $Ψ(n)$ of all solutions $m$ to $ϕ(m) = n$. In fact, in the worst case, $Ψ(n)$ is exponentially large, and cannot be computed in polynomial time. In the opposite direction, we show, under a widely accepted number theoretic conjecture, that there is a polynomial time reduction of the Partition Problem, an NP-complete problem, to the problem of deciding whether $ϕ(m) = n$ has a solution for a small set of integers n. This shows that the problem of de…
In this paper, we study some Euler-Apéry-type series which involve central binomial coefficients and (generalized) harmonic numbers. In particular, we establish elegant explicit formulas of some series by iterated integrals and alternating multiple zeta values. Based on these formulas, we further show that some other series are reducible to ln(2), zeta values, and alternating multiple zeta values by considering the contour integrals related to gamma functions, polygamma functions and trigonometric functions. The evaluations of a large number of special Euler-Apéry-type series are presented as …
For a field K, rational function phi in K(z) of degree at least two, and alpha in P^1(K), we study the polynomials in K[z] whose roots are given by the solutions to phi^n(z) = alpha, where phi^n denotes the nth iterate of phi. When the number of irreducible factors of these polynomials stabilizes as n grows, the pair (phi, alpha) is called eventually stable over K. We conjecture that (phi, alpha) is eventually stable over K when K is any global field and alpha any point not periodic under phi (an additional non-isotriviality hypothesis is necessary in the function field case). We prove the con…
Translation of the Latin original "Speculationes circa quasdam insignes proprietates numerorum" (1784). E564 in the Enestrom index. In this paper Euler talks about Farey sequences and proves some results about the phi function, the number of positive integers less than and relatively prime to an integer. Euler uses the notation pi instead of phi.
Lehmer's totient problem asks if there exist composite integers n satisfying the condition phi(n)|(n-1), (where phi is the Euler-phi function) while Carmichael numbers satisfy the weaker condition lambda(n)|(n-1) (where lambda is the Carmichael universal exponent function). We weaken the condition further, looking at those composite n where each prime divisor of phi(n) also divides n-1. (So rad(phi(n))|(n-1).) While these numbers appear to be far more numerous than the Carmichael numbers, we show that their distribution has the same rough upper bound as that of the Carmichael numbers, a bound …
In this paper we present a simple method for deriving recurrence relations and we apply it to obtain two equations involving the Lerch Phi function and sums of Bernoulli and Euler polynomials. Connections between these results and those obtained in a paper of H.M. Srivastava, M.L. Glasser and V. Adamchik are pointed out, emphasizing the usefulness of this approach with some meaningful examples.
For a number field K with absolute Galois group G_K, we consider the action of G_K on the infinite tree of preimages of a point in K under a degree-two rational function phi, with particular attention to the case when phi commutes with a non-trivial Mobius transfomation. In a sense this is a dynamical systems analogue to the l-adic Galois representation attached to an elliptic curve, with particular attention to the CM case. Using a result about the discriminants of numerators of iterates of phi, we give a criterion for the image of the action to be as large as possible. This criterion is in t…
We begin by introducing an interesting class of functions, known as the Schemmel totient functions, that generalizes the Euler totient function. For each Schemmel totient function $L_m$, we define two new functions, denoted $R_m$ and $H_m$, that arise from iterating $L_m$. Roughly speaking, $R_m$ counts the number of iterations of $L_m$ needed to reach either $0$ or $1$, and $H_m$ takes the value (either $0$ or $1$) that the iteration trajectory eventually reaches. Our first major result is a proof that, for any positive integer $m$, the function $H_m$ is completely multiplicative. We then int…
Let $T$ be the triangle with vertices (1,0), (0,1), (1,1). We study certain integrals over $T$, one of which was computed by Euler. We give expressions for them both as a linear combination of multiple zeta values, and as a polynomial in single zeta values. We obtain asymptotic expansions of the integrals, and of sums of certain multiple zeta values with constant weight. We also give related expressions for Euler's constant. In the final section, we evaluate more general integrals -- one is a Chen (Drinfeld-Kontsevich) iterated integral -- over some polytopes that are higher-dimensional analog…
We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power sums (e.g., cardinality) or extrema, without direct enumeration of the inverses. We illustrate our algorithm with Euler's totient function $φ(\cdot)$ and the $k$-th power sum of divisors $σ_k(\cdot)$. For example, we can establish that the number of solutions to $σ_1(x) = 10^{1000}$ is 15,512,215,160,488,452,125,793,724,066,873,737,608,071,476, while it is …
Let $N\geq 3$ be a composite, odd, and square-free integer and let $Γ$ be the principal congruence subgroup of level $N$. Let $X(N)$ be the modular curve of genus $g_Γ$ associated to $Γ$. In this article, we study the Arakelov invariant $e(Γ)=\barω^2/φ(N)$, with $\barω^2$ denoting the self-intersection of the relative dualizing sheaf for the minimal regular model of $X(N)$, equipped with the Arakelov metric, and $φ(N)$ is the Euler's phi function. Our main result is the asymptotics $e(Γ) = 2g_Γ\log(N) + o(g_Γ\log(N))$, as the level $N$ tends to infinity.
We consider relations between the pairs of sequences, $(f, g_f)$, generated by the Lambert series expansions, $L_f(q) = \sum_{n \geq 1} f(n) q^n / (1-q^n)$, in $q$. In particular, we prove new forms of recurrence relations and matrix equations defining these sequences for all $n \in \mathbb{Z}^{+}$. The key ingredient to the proof of these results is given by the statement of Euler's pentagonal number theorem expanding the series for the infinite $q$-Pochhammer product, $(q; q)_{\infty}$, and for the first $n$ terms of the partial products, $(q; q)_n$, forming the denominators of the rational …
Let $k\ge 1,a\ge 1,b\ge 0$ and $ c\ge 1$ be integers. Let $f$ be a multiplicative function with $f(n)\ne 0$ for all positive integers $n$. We define the arithmetic function $g_{k,f}$ for any positive integer $n$ by $g_{k,f}(n):=\frac{\prod_{i=0}^k f(b+a(n+ic))} {f({\rm lcm}_{0\le i\le k} \{b+a(n+ic)\})}$. We first show that $g_{k,f}$ is periodic and $c {\rm lcm}(1,...,k)$ is its period. Consequently, we provide a detailed local analysis to the periodic function $g_{k,φ}$, and determine the smallest period of $g_{k,φ}$, where $φ$ is the Euler phi function.
In this paper we define multiple Dedekind zeta values (MDZV), using a new type of iterated integrals, called iterated integrals on a membrane. One should consider MDZV as a number theoretic generalization of Euler's multiple zeta values. Over imaginary quadratic fields MDZV capture, in particular, multiple Eisenstein series (Gangl, Kaneko and Zagier). We give an analogue of multiple Eisenstein series over real quadratic field and an alternative definition of values of multiple Eisenstein-Kronecker series (Goncharov). Each of them is a special case of multiple Dedekind zeta values. MDZV are int…
In 1975 Walter Philipp proved the law of the iterated logarithm (LIL) for the discrepancy of lacunary sequences: for any sequence $(n_k)_{k \geq 1}$ satisfying the Hadamard gap condition $n_{k+1} / n_k \geq q > 1,~k \geq 1,$ we have $$ \frac{1}{4 \sqrt{2}} \leq \limsup_{N \to \infty} \frac{N D_N(\{ n_1 x \}, \dots, \{n_N x\})}{\sqrt{2 N \log \log N}} \leq C_q $$ for almost all $x$. In recent years there has been significant progress concerning the precise value of the limsup in this LIL for special sequences $(n_k)_{k \geq 1}$ having a ``simple'' number-theoretic structure. However, since the …