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 nt.number-theory
Search options not deleted
user 100873
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
3
votes
1
answer
746
views
Gauss' Circle Problem at $\left ( \frac{1}{2}, \frac{1}{2} \right ) $
GCP (Gauss' Circle Problem) asks for a closed form for the number of square-lattice points inside a circle, centered at the origin, of radius $r$.
Let's denote by $N(r)$ the number of these points. T …
- 193
1
vote
1
answer
531
views
Proof claimed of Gauss' Circle Problem
I just wanted to ask wether this problem has already been proved or not.
I know that there are 2 other posts that deal with exactly the same question, but I decided to ask it again, since they are t …
- 193
0
votes
0
answers
149
views
Mertens' Third Theorem for primes of the form $4n+1$
I am looking for upper and lower bounds for the following expression:
$$\prod_{\substack{p\le n \\ p \equiv 1\ mod\ 4}} \frac{p-1}{p}$$
Apart from the trivial one:
$$\prod_{\substack{p\le n \\ p \equi …
- 193