Search Results
| 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 prime-numbers
Search options not deleted
user 108143
Questions where prime numbers play a key-role, such as: questions on the distribution of prime numbers (twin primes, gaps between primes, Hardy–Littlewood conjectures, etc); questions on prime numbers with special properties (Wieferich prime, Wolstenholme prime, etc.). This tag is often used as a specialized tag in combination with the top-level tag nt.number-theory and (if applicable) analytic-number-theory.
-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 …
- 111
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$?
- 111