Integers divisible by sums of powers of their prime factors (Q2474298): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2007.01.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2003394897 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5291663 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integers Divisible by the Sum of their Prime Factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of solutions of decomposable form equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5587215 / rank | |||
Normal rank |
Latest revision as of 18:22, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Integers divisible by sums of powers of their prime factors |
scientific article |
Statements
Integers divisible by sums of powers of their prime factors (English)
0 references
5 March 2008
0 references
Let \(\beta_{j}(n)=\sum_{p\mid n}p^{j},\) \(\kappa(x)=\max\{k\geq 1:\beta_{j}(n)\mid n \text{ for all } j=1,\dots, k\text{ for some } n\leq x \text{ with } \omega(n)\geq 2\}\). In this paper, the authors prove: (1) If \(\omega(n)\geq 2\), there exist infinitely many positive integers \(n\) such that \(\beta_{j}(n)\mid n\) for all \(j=1,\dots, k\). (2) The estimate \(\kappa(x)\leq (\log x)/(4\log\log x)\) holds for all sufficiently large \(x\). The proof of (1) uses a result of Hua in additive prime number theory. The proof of (2) uses a result of Evertse in solutions to equation of integers.
0 references
prime powers
0 references
congruences
0 references
prime factors
0 references