Metraipolis › archive › dc_b2c63b2cff52

Artin's conjecture on primitive roots — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-10T01:31:17.500Z
SHA-256 of the archived text
7423cb95fa391ccae10dccd4fe8e2ca1f1030027de6be417d9854eee11bef098
Stable URL of this page
https://metraipolis.com/documento/dc_b2c63b2cff52

How to cite

Artin's conjecture on primitive roots — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_b2c63b2cff52 (Metraipolis archive dc_b2c63b2cff52, sha256 7423cb95fa391ccae10dccd4fe8e2ca1f1030027de6be417d9854eee11bef098)
BibTeX
@misc{dcb2c63b2cff52,
  title = {Artin's conjecture on primitive roots — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_b2c63b2cff52; sha256 7423cb95fa391ccae10dccd4fe8e2ca1f1030027de6be417d9854eee11bef098},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In number theory, Artin's conjecture on primitive roots states that a given integer a that is neither a square number nor −1 is a primitive root modulo infinitely many primes p. The conjecture also ascribes an asymptotic density to these primes. This conjectural density equals Artin's constant or a rational multiple thereof. The conjecture was made by Emil Artin to Helmut Hasse on September 27, 1927, according to the latter's diary. The conjecture is still unresolved as of 2026. In fact, there is no single value of a for which Artin's conjecture is proved. However, it is proven that there cannot be more than two primes for which Artin's conjecture fails. In October 2026, OpenAI released a catalogue of manuscripts produced by an internal model, including a paper (029) claiming an unconditional proof of the existence part of Artin's conjecture on primitive roots, establishing a density lower bound of cax/(logx)2 that is lower than the conjectured density. The result had not been reviewed by the mathematical community and did not have a Lean formalization at the time of its release.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Artin's conjecture on primitive roots» — https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots
Wikidata Q2319635: «in numbers theory, a given integer a which is not a perfect square and not −1 is a primitive root modulo infinitely many primes p» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2319635
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1382021276, consultata il 2026-11-10T01:28:17.105Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 572fe9a6e5270b18a085261a4f13be7defd2af97c13040e1869dd521644425bb