Paper detail

The smallest prime that does not split completely in a number field

We study the problem of bounding the least prime that does not split completely in a number field. This is a generalization of the classic problem of bounding the least quadratic non-residue. Here, we present two distinct approaches to this problem. The first is by studying the behavior of the Dedekind zeta function of the number field near 1, and the second by relating the problem to questions involving multiplicative functions. We derive the best known bounds for this problem for all number fields with degree greater than 2. We also derive the best known upper bound for the residue of the Dedekind zeta function in the case where the degree is small compared to the discriminant.

preprint2012arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Authors

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.