On locally repeated values of certain arithmetic functions. I (Q1063027): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: András Sárközy / rank
Normal rank
 
Property / author
 
Property / author: Carl B. Pomerance / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Lutz G. Lucht / rank
Normal rank
 
Property / author
 
Property / author: András Sárközy / rank
 
Normal rank
Property / author
 
Property / author: Carl B. Pomerance / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105890390 / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Lutz G. Lucht / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867877 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-314x(85)90059-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083826093 / rank
 
Normal rank

Latest revision as of 09:43, 30 July 2024

scientific article
Language Label Description Also known as
English
On locally repeated values of certain arithmetic functions. I
scientific article

    Statements

    On locally repeated values of certain arithmetic functions. I (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    It is shown that, for certain integer-valued arithmetic functions \(f\), the equation \(n+f(n)=m+f(m)\) has infinitely many solutions with \(n\neq m\). Let \(\nu(n)\) denote the number of distinct prime factors of \(n\). Then, for \(f=\nu\), a lower bound for the number of solutions \(n,m\leq x\) is given.
    0 references
    0 references
    arithmetic functions
    0 references
    number of distinct prime factors
    0 references
    lower bound
    0 references
    number of solutions
    0 references
    0 references
    0 references
    0 references
    0 references