Uniformly counting primes with a given primitive root and in an arithmetic progression (Q4971994): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vinogradov’s three primes theorem with primes having given primitive roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Artin's conjecture. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Artin's conjecture and Euclid's algorithm in global fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Character sums for primitive root densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3423329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On primes in arithmetic progression having a prescribed primitive root. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The correction factor in Artin's primitive root conjecture. / rank
 
Normal rank

Revision as of 02:16, 21 July 2024

scientific article; zbMATH DE number 7135182
Language Label Description Also known as
English
Uniformly counting primes with a given primitive root and in an arithmetic progression
scientific article; zbMATH DE number 7135182

    Statements

    Uniformly counting primes with a given primitive root and in an arithmetic progression (English)
    0 references
    0 references
    22 November 2019
    0 references
    0 references
    Artin's primitive root conjecture
    0 references
    primitive roots
    0 references
    primes in arithmetic progressions
    0 references
    0 references