scholarly journals A new upper bound for numbers with the Lehmer property and its application to repunit numbers

2019 ◽  
Vol 15 (07) ◽  
pp. 1463-1468
Author(s):  
Dominik Burek ◽  
Błażej Żmija
Keyword(s):  
Positive Integer ◽  
Real Number ◽  
Upper Bound ◽  
Prime Divisors ◽  
Euler Totient Function ◽  
Number Of Prime Divisors

A composite positive integer [Formula: see text] has the Lehmer property if [Formula: see text] divides [Formula: see text] where [Formula: see text] is an Euler totient function. In this paper, we shall prove that if [Formula: see text] has the Lehmer property, then [Formula: see text], where [Formula: see text] is the number of prime divisors of [Formula: see text]. We apply this bound to repunit numbers and prove that there are at most finitely many numbers with the Lehmer property in the set [Formula: see text] where [Formula: see text] denotes the highest power of 2 that divides [Formula: see text], and [Formula: see text] is a fixed real number.

scholarly journals On the residue class distribution of the number of prime divisors of an integer

2011 ◽  
Vol 202 ◽  
pp. 15-22 ◽  
Author(s):  
Michael Coons ◽  
Sander R. Dahmen
Keyword(s):  
Positive Integer ◽  
Error Term ◽  
Residue Class ◽  
Prime Divisors ◽  
Class Distribution ◽  
Multiplicity One ◽  
Counting Multiplicity ◽  
Number Of Prime Divisors

AbstractLet Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any positive integer m and all j = 0,1,…,m – 1, we havewith α = 1. Building on work of Kubota and Yoshida, we show that for m > 2 and any j = 0,1,…,m – 1, the error term is not o(xα) for any α < 1.

scholarly journals On the residue class distribution of the number of prime divisors of an integer

2011 ◽  
Vol 202 ◽  
pp. 15-22
Author(s):  
Michael Coons ◽  
Sander R. Dahmen
Keyword(s):  
Positive Integer ◽  
Error Term ◽  
Residue Class ◽  
Prime Divisors ◽  
Class Distribution ◽  
Multiplicity One ◽  
Counting Multiplicity ◽  
Number Of Prime Divisors

AbstractLet Ω(n) denote the number of prime divisors ofncounting multiplicity. One can show that for any positive integermand allj= 0,1,…,m– 1, we havewithα= 1. Building on work of Kubota and Yoshida, we show that form&gt; 2 and anyj= 0,1,…,m– 1, the error term is noto(xα) for anyα&lt; 1.

scholarly journals On the Riesz means of $\frac{n}{\phi(n)}$

2013 ◽  
Vol Volume 36 ◽  
Author(s):  
A Sankaranarayanan ◽  
Saurabh Kumar Singh
Keyword(s):  
Positive Integer ◽  
Upper Bound ◽  
Error Term ◽  
Arithmetical Function ◽  
Riesz Means ◽  
Riesz Mean ◽  
Euler Totient Function ◽  
International Audience

International audience Let $\phi(n)$ denote the Euler-totient function. We study the error term of the general $k$-th Riesz mean of the arithmetical function $\frac {n}{\phi(n)}$ for any positive integer $k \ge 1$, namely the error term $E_k(x)$ where \[ \frac{1}{k!}\sum_{n \leq x}\frac{n}{\phi(n)} \left( 1-\frac{n}{x} \right)^k = M_k(x) + E_k(x). \] The upper bound for $\left | E_k(x) \right |$ established here thus improves the earlier known upper bound when $k=1$.

scholarly journals A maximal Gross-Stadje number in the Euclidean plane

2000 ◽  
Vol 61 (1) ◽  
pp. 109-119
Author(s):  
F. Pillichshammer
Keyword(s):  
Continuous Function ◽  
Positive Integer ◽  
Real Number ◽  
Upper Bound ◽  
Euclidean Distance ◽  
Hausdorff Space ◽  
Euclidean Plane ◽  
Distance Geometry ◽  
Open Question ◽  
Squared Euclidean Distance

Let X be a compact, connected Hausdorff space and f a real valued, symmetric, continuous function on X × X. Then the Gross-Stadje number r (X, f) is the unique real number with the property that for each positive integer n and for all (not necessarily distinct) x1,…,xn in X, there exists some x in X such that . This paper solves the following open question in distance geometry: What is the least upper bound g2(R2) of r (X, d2), where X ranges over all compact, connected subsets of the Euclidean plane with diameter one and where d2 denotes the squared, Euclidean distance. We show: .

scholarly journals On the Ternary Exponential Diophantine Equation Equating a Perfect Power and Sum of Products of Consecutive Integers

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1813
Author(s):  
S. Subburam ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Upper Bound ◽  
Exponential Diophantine Equation ◽  
Research Article ◽  
All Solutions ◽  
Sum Of Products ◽  
Consecutive Integers ◽  
Sums Of Products ◽  
Positive Integers

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.

scholarly journals A new characterization of L2(p2)

2020 ◽  
Vol 18 (1) ◽  
pp. 907-915
Author(s):  
Zhongbi Wang ◽  
Chao Qin ◽  
Heng Lv ◽  
Yanxiong Yan ◽  
Guiyun Chen
Keyword(s):  
Positive Integer ◽  
Irreducible Character ◽  
Character Degrees ◽  
Prime Divisors

Abstract For a positive integer n and a prime p, let {n}_{p} denote the p-part of n. Let G be a group, \text{cd}(G) the set of all irreducible character degrees of G , \rho (G) the set of all prime divisors of integers in \text{cd}(G) , V(G)=\left\{{p}^{{e}_{p}(G)}|p\in \rho (G)\right\} , where {p}^{{e}_{p}(G)}=\hspace{.25em}\max \hspace{.25em}\{\chi {(1)}_{p}|\chi \in \text{Irr}(G)\}. In this article, it is proved that G\cong {L}_{2}({p}^{2}) if and only if |G|=|{L}_{2}({p}^{2})| and V(G)=V({L}_{2}({p}^{2})) .

On the kth root partition function

2021 ◽  
pp. 1-15
Author(s):  
Ya-Li Li ◽  
Jie Wu
Keyword(s):  
Partition Function ◽  
Positive Integer ◽  
Asymptotic Formula ◽  
Real Number ◽  
Number Of Solutions ◽  
Asymptotic Development ◽  
Number Formula

For any positive integer [Formula: see text], let [Formula: see text] be the number of solutions of the equation [Formula: see text] with integers [Formula: see text], where [Formula: see text] is the integral part of real number [Formula: see text]. Recently, Luca and Ralaivaosaona gave an asymptotic formula for [Formula: see text]. In this paper, we give an asymptotic development of [Formula: see text] for all [Formula: see text]. Moreover, we prove that the number of such partitions is even (respectively, odd) infinitely often.

scholarly journals ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS

2009 ◽  
Vol 51 (2) ◽  
pp. 243-252
Author(s):  
ARTŪRAS DUBICKAS
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Real Number ◽  
Constant Independent ◽  
Integer Sequences ◽  
Real Numbers ◽  
Complexity Function ◽  
Linear Maps ◽  
Coprime Integers ◽  
Positive Integers

AbstractLetx0<x1<x2< ⋅⋅⋅ be an increasing sequence of positive integers given by the formulaxn=⌊βxn−1+ γ⌋ forn=1, 2, 3, . . ., where β > 1 and γ are real numbers andx0is a positive integer. We describe the conditions on integersbd, . . .,b0, not all zero, and on a real number β > 1 under which the sequence of integerswn=bdxn+d+ ⋅⋅⋅ +b0xn,n=0, 1, 2, . . ., is bounded by a constant independent ofn. The conditions under which this sequence can be ultimately periodic are also described. Finally, we prove a lower bound on the complexity function of the sequenceqxn+1−pxn∈ {0, 1, . . .,q−1},n=0, 1, 2, . . ., wherex0is a positive integer,p>q> 1 are coprime integers andxn=⌈pxn−1/q⌉ forn=1, 2, 3, . . . A similar speculative result concerning the complexity of the sequence of alternatives (F:x↦x/2 orS:x↦(3x+1)/2) in the 3x+1 problem is also given.

scholarly journals On the number of prime divisors of the order of elliptic curves modulo p

2005 ◽  
Vol 117 (4) ◽  
pp. 341-352 ◽  
Author(s):  
Jörn Steuding ◽  
Annegret Weng
Keyword(s):  
Elliptic Curves ◽  
Prime Divisors ◽  
Modulo P ◽  
Number Of Prime Divisors

scholarly journals The Exponent of the Homotopy Groups of Moore Spectra and the Stable Hurewicz Homomorphism

1996 ◽  
Vol 48 (3) ◽  
pp. 483-495 ◽  
Author(s):  
Dominique Arlettaz
Keyword(s):  
Abelian Group ◽  
Positive Integer ◽  
Upper Bound ◽  
Homology Theory ◽  
Homotopy Groups ◽  
Integral Homology ◽  
Ring Spectrum ◽  
Bounded Below ◽  
Torsion Free ◽  
Ordinary Integral

AbstractThis paper shows that for the Moore spectrum MG associated with any abelian group G, and for any positive integer n, the order of the Postnikov k-invariant kn+1(MG) is equal to the exponent of the homotopy group πnMG. In the case of the sphere spectrum S, this implies that the exponents of the homotopy groups of S provide a universal estimate for the exponent of the kernel of the stable Hurewicz homomorphism hn: πnX → En(X) for the homology theory E*(—) corresponding to any connective ring spectrum E such that π0E is torsion-free and for any bounded below spectrum X. Moreover, an upper bound for the exponent of the cokernel of the generalized Hurewicz homomorphism hn: En(X) → Hn(X; π0E), induced by the 0-th Postnikov section of E, is obtained for any connective spectrum E. An application of these results enables us to approximate in a universal way both kernel and cokernel of the unstable Hurewicz homomorphism between the algebraic K-theory of any ring and the ordinary integral homology of its linear group.

Sign in / Sign up

Export Citation Format

Share Document