Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 108143

Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions

-1 votes
1 answer
308 views

Inert primes in arithmetic progression

Let $a,m$ an integers s.t $(a,m)=1$. Let $K$ a quadratic field, I would like to calculate the natural density of the set $$\{p \;\; \text{rational prime}\; /\; p\;\text{inert in}\; K,\; p\equiv a\pmo …
square-free's user avatar
5 votes
1 answer
275 views

Question about Fourier coefficients of a newform at primes

For $q:=e^{2\pi i z},$ let $f(z)=\sum_{n\ge 1}\lambda(n)n^{(k-1)/2}q^n$ be a normalized newform of type $(k,\chi)$ and level $N$. For any prime $p,$ we have $$\lambda(p)=2\cos(\theta_p)\;\;\;\text{f …
square-free's user avatar
4 votes
1 answer
243 views

Is there an $n\ge1$ such that every prime $p\equiv1\pmod{9}$ is representable in the form $x... [closed]

Is there an integer $n\ge1$ such that every prime $p\equiv1\pmod{9}$ is representable in the form $x^2+ny^2$?
square-free's user avatar