Delphi.science

An Unconditional Artin–Matthews Theorem for Simultaneous Primitive Roots

Source: github.com/Vlado-V/unconditional-artin-matthews/tree/04f62f…

Vlado Vojdanovski

Palomar Registrypalomar/PALOMAR-2026-11-11-000004Nov 11, 2026math.NTscore 0

For a nonempty finite set of integers excluding 0, 1, and −1, consider the primes for which every integer in the set is a primitive root. When neither Matthews obstruction occurs, the simultaneous primitive primes have a lower bound of order x/log x in every sufficiently large real dyadic interval (x, 2x] and positive lower relative density among the primes. When either obstruction occurs, the simultaneous primitive primes form a finite set. This is Theorem 1.1 of the accompanying paper.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-11-000004
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-11-000004/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-11-000004/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'