Kevin Ford, Yong Hu
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We compare the asymptotic behavior of Carmichael's lambda function composed with Euler's totient function to the asymptotic behavior of Carmichael's lambda function composed with itself. We establish the normal order of the logarithm of the ratio.
We investigate two arithmetic functions naturally occurring in the study of the Euler and Carmichael quotients. The functions are related to the frequency of vanishing of the Euler and Carmichael quotients. We obtain several results concerning the relations between these functions as well as their typical and extreme values.
Ours go to 211: Euler pseudoprimes to 47 prime bases (from Carmichael numbers)
本文研究了卡迈克尔数中包含的欧拉伪素数，并提出了一种快速算法来生成新的欧拉伪素数，其中某些伪素数能够通过前47个素数基的测试。
$(a,a)$-Carmichael numbers and greatest common divisors of $p-a$
研究(a,a)-卡迈克尔数，通过定义K及C_ν(X,a)，在关于算术级数中首个素数的强猜想下，证明对特定整数a和自然数ν，给出C_ν(X,a)的下界。
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 …
We find analogues of the primitive divisor results of Zsigmondy, Bang, Bilu-Hanrot-Voutier, and Carmichael in polynomial rings, following the methods of Carmichael.
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.
Lehmer's totient problem consists of determining the set of positive integers $n$ such that $φ(n)|n-1$ where $φ$ is Euler's totient function. In this paper we introduce the concept of $k$-Lehmer number. A $k$-Lehmer number is a composite number such that $φ(n)|(n-1)^k$. The relation between $k$-Lehmer numbers and Carmichael numbers leads to a new characterization of Carmichael numbers and to some conjectures related to the distribution of Carmichael numbers which are also $k$-Lehmer numbers.
On Euler's totient function of polynomials over finite fields
该研究聚焦有限域上多项式的Euler totient函数的算术性质，分析多个经典数论猜想的多项式类比形式，拓展了有限域多项式数论的研究方向。
Carmichael showed for sufficiently large $L$, that $F_L$ has at least one prime divisor that is $\pm 1({\rm mod}\, L)$. For a given $F_L$, we will show that a product of distinct odd prime divisors with that congruence condition is a Fibonacci pseudoprime. Such pseudoprimes can be used in an attempt, here unsuccessful, to find an example of a Baillie-PSW pseudoprime, i.e.\ an odd Fibonacci pseudoprime that is congruent to $\pm 2({\rm mod}\, 5)$ and is also a base-2 pseudoprime.
On Types of Elliptic Pseudoprimes
本文推广椭圆伪素数概念，定义Euler椭圆Carmichael数与强椭圆Carmichael数，研究其与异常素数乘积及Type I椭圆Korselt数的关系，并证明相关密度猜想。
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.
Explicit formulas for Euler's totient function and the number of divisors
该研究利用 Menon 关系及与 Pillai 算术函数的联系，给出 φ(n) 与 τ(n) 基于取整有限和或 gcd 的显式公式，可为算术函数新界提供工具。
On a certain arithmetic function defined via Bernoulli numbers
研究定义在奇数\(n\geq3\)上、通过伯努利数构造的算术函数，该函数将素数、卡迈克尔数和久加数统一到一个整除性准则中，为相关研究提供新视角。
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$.
Definition of the invariant and the relationship with the compounds numbers. Generalisation of the Euler theorem
本文引入不变量的概念及其性质用于素性检验，结合欧拉定理将其推广至所有 $a^{φ(m)}$ 情形，并提出替代 Totient 函数以解释 Carmichael 数的新假设。
Exceptional sets for compositions involving Euler's function,the divisor-sum function and Dedekind's function
该数论研究针对欧拉函数、除数和函数与戴德金函数的四类复合函数，推导了相关例外集的定量上界与密度为零的估计，改进了已有研究成果。
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.
We show, in an effective way, that there exists a sequence of congruence classes $a_k\pmod {m_k}$ such that the minimal solution $n=n_k$ of the congruence $ϕ(n)\equiv a_k\pmod {m_k}$ exists and satisfies $\log n_k/\log m_k\to\infty $ as $k\to\infty$. Here, $ϕ(n)$ is the Euler function. This answers a question raised in \cite{FS}. We also show that every congruence class containing an even integer contains infinitely many values of the Carmichael function $λ(n)$ and the least such $n$ satisfies $n\ll m^{13}$.
Divisors in windows and the Euler--Mascheroni constant
该数学研究推导了区间内除数个数的平均值公式，涉及欧拉-马歇罗尼常数等，结果在Lean 4中得到形式化验证。
In this article, we investigate sparse subsets of the natural numbers and study the sparseness of some sets associated with the Euler's totient function $ϕ$ via the property of `Banach Density'. These sets related to the totient function are defined as follows: $V:=ϕ(\mathbb{N})$ and $N_i:=\{N_i(m)\colon m\in V \}$ for $i = 1, 2, 3,$ where $N_1(m)=\max\{x\in \mathbb{N}\colon ϕ(x)\leq m\}$, $N_2(m)=\max(ϕ^{-1}(m))$ and $N_3(m)=\min(ϕ^{-1}(m))$ for $ m\in V$. Masser and Shiu call the elements of $N_1$ as `sparsely totient numbers' and construct an infinite family of these numbers. Here we constr…
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…
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 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.
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.
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.
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 …
Maximal order for divisor functions and zeros of the Riemann zeta-function
本文将黎曼ζ函数的无零点区域与除数幂和函数的极大阶关联，给出了用除数的1/2次幂和函数及黎曼ζ函数部分欧拉乘积表示的黎曼假设等价条件。
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$.
On a Smoothed Walfisz Divisor Problem
用除数函数σ替换Dirichlet除数函数τ，研究平滑Dirichlet除数问题，证明σ(n)加权和的显式渐近公式，从而消除经典平均阶中的困难部分，并推导Walfisz除数问题中误差项积分的收敛性。
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.
On a relation to the Riemann Hypothesis and an analytic part for the divisor function
研究sigma_1(n)求和函数相关的解析部分，并在黎曼猜想下给出显式上界。
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.
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…
Two inequalities involving the Euler totient function and the sum of the $k$-th powers of the divisors of balancing numbers are explored.
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$.
A recurrence in logarithmic Möbius sums with coprimality conditions via Euler--Maclaurin
该研究结合默比乌斯反演与欧拉-麦克劳林公式推导对数默比乌斯和的递推关系，得到多项式近似，扩展到带互素条件及除数和函数倒数加权的和，并证明后者非负性。
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 $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$. However, the $j$th non-trivial divisor function $c_j$, which counts the ordered proper factorisations of a positive integer into $j$ factors, each of which is greater than or equal to 2, is rather less well-studied. We also consider associated divisor functions $c_j^{(r)}$, whose definition is motivated by the sum-over divisors recurrence for $d_j$. After reviewin…
We extend the sum-of-divisors function to the complex plane via the Gaussian integers. Then we prove a modified form of Euler's classification of odd perfect numbers.
The maximal order of the shifted-prime divisor function
研究移位素数除数函数ω*(n)的极大阶，通过改进Prachar及Adleman、Pomerance和Rumely的论证，无条件将下界指数提升至0.6736log2·log n/log log n，并在GRH下提升至log((1+√5)/2)·log n/log log n。
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, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, and other special functions. Some of our results improve the error terms obtained by Bordellès and Cloitre. We formulate certain open problems.
Euler-type Recurrence Relations for Partition Functions with Congruence Conditions
该研究针对模$\delta$同余于0或$\pm g$的分拆函数$p_{\delta,g}(n)$，利用广义戴德金η函数与Rankin-Cohen括号推导欧拉型递推关系，还得到$\delta=5$的显式递推、拉马努金型同余及拉德马赫型公式。
If \(A \) is a set of natural numbers containing \(0 \), then there is a unique nonempty "reciprocal" set \(B \) of natural numbers (containing \(0 \)) such that every positive integer can be written in the form \(a + b \), where \(a \in A \) and \(b \in B \), in an even number of ways. Furthermore, the generating functions for \(A \) and \(B \) over \(\FF_2 \) are reciprocals in \(\FF_2 [[q]] \). We consider the reciprocal set \(B \) for the set \(A \) containing \(0 \) and all integers such that \(σ(n) \) is odd, where \(σ(n) \) is the sum of all the positive divisors of \(n \). This problem…
Monotone non-decreasing sequences of the Euler totient function
本文研究使 Euler 函数非递减的最大子集规模，证明其渐近等于 $π(x)$，并对除数和函数得到类似结论。
The number of preimages of iterates of $ϕ$ and $σ$
本文将 Euler 函数 $ϕ$ 和 $σ$ 原像数量的渐近上界扩展至其迭代情形，并借此证明了 Konick 和 Katai 论文中的相关猜想及推论。
Let $d(n)$ be the number of divisors of $n$, let $γ$ denote Euler's constant and $$ Δ(x) := \sum_{n\le x}d(n) - x(\log x + 2γ-1) $$ denote the error term in the classical Dirichlet divisor problem, and let $ζ(s)$ denote the Riemann zeta-function. It is shown that $$ \int_0^TΔ(t)|ζ(1/2+it)|^2\,dt \ll T(\log T)^{4}. $$ Further, if $2\le k\le 8$ is a fixed integer, then we prove the asymptotic formula $$ \int_1^{T}Δ^{k}(t)|ζ(1/2+it)|^2\,dt=c_1(k)T^{1+\frac k4}\log T+ c_2(k)T^{1+\frac k4}+O_\varepsilon(T^{1+\frac k4-η_k+\varepsilon}), $$ where $c_1(k)$ and $c_2(k)$ are explicit constants, and wher…
Euler-type Recurrence Relation for Arbitrary Arithmetical Function
本研究借助Lambert级数与欧拉分拆定理，推导出任意算术函数的欧拉型递推关系，并进一步得到若干知名算术函数、特定分拆函数及除数和函数的对应递推关系。
Lehmer's totient problem asks whether there exists any composite number $n$ such that $φ(n) \, \mid \, (n-1)$, where $φ$ is Euler totient function. It is known that if any such $n$ exists, it must be Carmichael and $n > 10^{30}$. In this paper, we develop a new approach to the problem via some recent results in group theory related to a function $ψ$ (the sum of order of elements of a group) and show that if $k φ(n) = n-1$ for some integer $k$, then $k$ must be $\geq 3$, and actually, if $5, 7, 11, 13 \not | n$, $k \geq 4$. This implies that any counterexample must be such that $n > 10^{8171}$ …
In the work we shall present formulas to sum Lambert series using Euler's q-exponential functions, and several Lambert series associated with well-known arithmetic functions are given as examples. These functions are: the Möbius $μ(n)$, the Euler's totient $φ(n)$, Jordan's totient $J_{k}(n)$, von Mangoldt $Λ(n)$, divisor function $σ_{s}(n)$, the Ramanujan's sum $c_{q}(n)$ , and sum of square functions $r_{2}(n),r_{4}(n),r_{8}(n)$.
Generalized relations between arithmetic functions
本文研究算术函数之间的广义关系，推导出一个涉及莫比乌斯函数和欧拉函数的恒等式，并探讨其与欧拉乘积和黎曼ζ函数的关系。
Let $k$ be a fixed finite geometric extension of the rational function field $\mathbb{F}_q(t)$. Let $F/k$ be a finite abelian extension such that there is an $\Fq$-rational place $\infty$ in $k$ which splits in $F/k$ and let $\mathcal{O}_F$ denote the integral closure in $F$ of the ring of functions in $k$ that are regular outside $\infty$. We describe algorithms for computing the divisor class number and in certain cases for computing the structure of the divisor class group and discrete logarithms between Galois conjugate divisors in the divisor class group of $F$. The algorithms are efficie…
Let $σ(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $σ(n) < e^γn \log \log n$ holds for every positive integer $n \geq 5041$, where $γ$ is the Euler-Mascheroni constant. In this paper we establish a new family of integers for which Robin's inequality $σ(n) < e^γn \log \log n$ hold. Further, we establish a new unconditional upper bound for the sum of divisors function. For this purpose, we use an approximation for Chebyshev's $\vartheta$-function and for some product defined over prime numbers.
A statistical investigation of a divisor-sum function
本文研究了与实际数推广相关的函数S_s(n)的统计性质，证明了S_s(n)/n具有连续渐近分布函数，并建立了其均值计算和高阶矩的统一界。
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.
The distribution of $\gcd(n,ϕ(n))$
本文研究 $\gcd(n,\phi(n))$ 及其因子的分布，推广了 Erdős 和 Pollack 的先前结果。
On the representation of number-theoretic functions by arithmetic terms
本文提出了数论中多个基本函数（如p进赋值、除数函数、欧拉函数等）的闭式表达式，这些表达式仅用初等运算表示，且为首次发现。
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。