Artin's primitive root conjecture
GPTKB entity
Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
prime numbers
primitive roots |
| gptkbp:conditionalProof |
gptkb:Generalized_Riemann_Hypothesis
|
| gptkbp:field |
number theory
|
| gptkbp:hasArtinConstant |
0.3739558136...
|
| gptkbp:namedAfter |
gptkb:Emil_Artin
|
| gptkbp:proposedBy |
gptkb:Emil_Artin
|
| gptkbp:relatedTo |
gptkb:Generalized_Riemann_Hypothesis
primitive root modulo n |
| gptkbp:state |
Any integer a that is not -1 or a perfect square is a primitive root modulo infinitely many primes.
|
| gptkbp:status |
unproven
|
| gptkbp:yearProposed |
1927
|
| gptkbp:bfsParent |
gptkb:Artin_conjecture
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Artin's primitive root conjecture
|