Tight upper and lower bounds for the reciprocal sum of Proth primes (Q2168698): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sur un problème concernant les nombres \(k\cdot 2^n + 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of odd integers of the form \((p-1)2^{-n}\) and related questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DENSITY OF INTEGERS OF THE FORM (<i>p</i>−1)2<sup>−<i>n</i></sup> IN ARITHMETIC PROGRESSIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are infinitely many Carmichael numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5278235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds on Brun’s Constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primes with a Prime Subscript / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONJECTURES INVOLVING ARITHMETICAL SEQUENCES / rank
 
Normal rank

Latest revision as of 00:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Tight upper and lower bounds for the reciprocal sum of Proth primes
scientific article

    Statements

    Tight upper and lower bounds for the reciprocal sum of Proth primes (English)
    0 references
    0 references
    26 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Proth numbers
    0 references
    Proth primes
    0 references
    arithmetic progressions
    0 references
    0 references