Consecutive Integers with Close Kernels

2018 ◽  
Vol 62 (3) ◽  
pp. 469-473
Author(s):  
Jean-Marie De Koninck ◽  
Florian Luca
Keyword(s):  
Positive Integer ◽  
Arbitrary Positive Integer ◽  
Euler Function ◽  
Prime Factors ◽  
Consecutive Integers

AbstractLet $k$ be an arbitrary positive integer and let $\unicode[STIX]{x1D6FE}(n)$ stand for the product of the distinct prime factors of $n$. For each integer $n\geqslant 2$, let $a_{n}$ and $b_{n}$ stand respectively for the maximum and the minimum of the $k$ integers $\unicode[STIX]{x1D6FE}(n+1),\unicode[STIX]{x1D6FE}(n+2),\ldots ,\unicode[STIX]{x1D6FE}(n+k)$. We show that $\liminf _{n\rightarrow \infty }a_{n}/b_{n}=1$. We also prove that the same result holds in the case of the Euler function and the sum of the divisors function, as well as the functions $\unicode[STIX]{x1D714}(n)$ and $\unicode[STIX]{x1D6FA}(n)$, which stand respectively for the number of distinct prime factors of $n$ and the total number of prime factors of $n$ counting their multiplicity.

scholarly journals ON A VARIATION OF A CONGRUENCE OF SUBBARAO

2012 ◽  
Vol 93 (1-2) ◽  
pp. 85-90 ◽  
Author(s):  
ANDREJ DUJELLA ◽  
FLORIAN LUCA
Keyword(s):  
Positive Integer ◽  
Continued Fractions ◽  
Euler Function ◽  
Prime Factors ◽  
Finite Set ◽  
Positive Integers ◽  
Sum Of Divisors

AbstractWe study positive integers $n$ such that $n\phi (n)\equiv 2\hspace{0.167em} {\rm mod}\hspace{0.167em} \sigma (n)$, where $\phi (n)$ and $\sigma (n)$ are the Euler function and the sum of divisors function of the positive integer $n$, respectively. We give a general ineffective result showing that there are only finitely many such $n$ whose prime factors belong to a fixed finite set. When this finite set consists only of the two primes $2$ and $3$ we use continued fractions to find all such positive integers $n$.

scholarly journals The Solutions of Generalized Euler Function Equation φ_2(n-φ_2 (n))=2ω(n)

2021 ◽  
pp. 15-22
Author(s):  
Xu Yifan ◽  
Shen Zhongyan
Keyword(s):  
Positive Integer ◽  
Upper Bound ◽  
Euler Function ◽  
Prime Factors ◽  
Integer Solutions

By using the properties of Euler function, an upper bound of solutions of Euler function equation  is given, where  is a positive integer. By using the classification discussion and the upper bound we obtained, all positive integer solutions of the generalized Euler function equation  are given, where is the number of distinct prime factors of n.

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.

On the prime factors of the iterates of the Ramanujan τ–function

2020 ◽  
Vol 63 (4) ◽  
pp. 1031-1047
Author(s):  
Florian Luca ◽  
Sibusiso Mabaso ◽  
Pantelimon Stănică
Keyword(s):  
Positive Integer ◽  
Prime Factors

AbstractIn this paper, for a positive integer n ≥ 1, we look at the size and prime factors of the iterates of the Ramanujan τ function applied to n.

On triplets with descending largest prime factors

2001 ◽  
Vol 38 (1-4) ◽  
pp. 45-50 ◽  
Author(s):  
A. Balog
Keyword(s):  
Prime Factor ◽  
Prime Factors ◽  
Consecutive Integers

For an integer n≯1 letP(n) be the largest prime factor of n. We prove that there are infinitely many triplets of consecutive integers with descending largest prime factors, that is P(n - 1) ≯P(n)≯P(n+1) occurs for infinitely many integers n.

The Distribution Of Totatives

1955 ◽  
Vol 7 ◽  
pp. 347-357 ◽  
Author(s):  
D. H. Lehmer
Keyword(s):  
Positive Integer ◽  
Prime Factors ◽  
Image Position

This paper is concerned with the numbers which are relatively prime to a given positive integerwhere the p's are the distinct prime factors of n. Since these numbers recur periodically with period n, it suffices to study the ϕ(n) numbers ≤n and relatively prime to n.

scholarly journals Anti-integral extensions $ {R[{\alpha}]/R$

2004 ◽  
Vol 35 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Kiyoshi Baba ◽  
Ken-Ichi Yoshida
Keyword(s):  
Positive Integer ◽  
Integral Domain ◽  
Arbitrary Positive Integer ◽  
Integral Element ◽  
The Ideal

Let $ R $ be an integral domain and $ \alpha $ an anti-integral element of degree $ d $ over $ R $. In the paper [3] we give a condition for $ \alpha^2-a$ to be a unit of $ R[\alpha] $. In this paper we will generalize the result to an arbitrary positive integer $n$ and give a condition, in terms of the ideal $ I_{[\alpha]}^{n}D(\sqrt[n]{a}) $ of $ R $, for $ \alpha^{n}-a$ to be a unit of $ R[\alpha] $.

scholarly journals An estimate for trigonometrical sums over square-free integers with a constant number of prime factors

1967 ◽  
Vol 15 (4) ◽  
pp. 249-255
Author(s):  
Sean Mc Donagh
Keyword(s):  
Positive Integer ◽  
Real Number ◽  
Prime Number ◽  
Rational Number ◽  
Large Integer ◽  
Constant Number ◽  
The Real ◽  
Prime Factors ◽  
Squarefree Number ◽  
Image Position

1. In deriving an expression for the number of representations of a sufficiently large integer N in the formwhere k: is a positive integer, s(k) a suitably large function of k and pi is a prime number, i = 1, 2, …, s(k), by Vinogradov's method it is necessary to obtain estimates for trigonometrical sums of the typewhere ω = l/k and the real number a satisfies 0 ≦ α ≦ 1 and is “near” a rational number a/q, (a, q) = 1, with “large” denominator q. See Estermann (1), Chapter 3, for the case k = 1 or Hua (2), for the general case. The meaning of “near” and “arge” is made clear below—Lemma 4—as it is necessary for us to quote Hua's estimate. In this paper, in Theorem 1, an estimate is obtained for the trigonometrical sumwhere α satisfies the same conditions as above and where π denotes a squarefree number with r prime factors. This estimate enables one to derive expressions for the number of representations of a sufficiently large integer N in the formwhere s(k) has the same meaning as above and where πri, i = 1, 2, …, s(k), denotes a square-free integer with ri prime factors.

scholarly journals On strings of consecutive integers with no large prime factors

1998 ◽  
Vol 64 (2) ◽  
pp. 266-276 ◽  
Author(s):  
Antal Balog ◽  
Trevor D. Wooley
Keyword(s):  
Integer Coefficients ◽  
Prime Factors ◽  
Consecutive Integers ◽  
Binomial Polynomials

AbstractWe investigate conditions which ensure that systems of binomial polynomials with integer coefficients are simultaneously free of large prime factors. In particular, for each positive number ε, we show that there are infinitely many strings of consecutive integers of size about n, free of prime factors exceeding nε, with the length of the strings tending to infinity with speed log log log log n.

Prime Factors of Consecutive Integers

1972 ◽  
Vol 79 (10) ◽  
pp. 1082-1089 ◽  
Author(s):  
E. F. Ecklund ◽  
R. B. Eggleton
Keyword(s):  
Prime Factors ◽  
Consecutive Integers
Sign in / Sign up

Export Citation Format

Share Document