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 analytic-number-theory
Search options not deleted
user 74453
On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.
1
vote
1
answer
270
views
Least simultaneous quadratic non-residue
Suppose $p,q$ are distinct primes with least quadratic non-residues $n_p$ and $n_q$ respectively. Can one bound the least $n$ for which $\left(\frac{n}{p}\right)=\left(\frac{n}{q}\right)=-1$ in terms …
- 5,169
22
votes
1
answer
846
views
How big can a set of integers be if all pairs have small gcd?
Suppose $A\subset[1,N]$ is a set of integers. If for any distinct $a,b\in A$ we have $(a,b)\leq M$ then how big can $|A|$ be?
If $M=1$ then $|A|$ is at most $\pi(N)$ since the map $a\mapsto P_+(a)$ …
CommunityBot
- 1
3
votes
1
answer
434
views
Least prime for which a square-free integer is a non-residue
Suppose $a$ is a square-free integer and $\left(\frac{a}{p}\right)=1$ for the primes $p\leq k$. I'll call $a$ a quasi-square of order $k$. What I am interested in is the maximum value of $k$ in terms …
- 105k
3
votes
0
answers
157
views
Liouville's function and Legendre Symbols
Suppose $p$ is a prime and let $\left(\frac{a}{p}\right)$ denote the Legendre symbol modulo $p$. If $a$ is not a perfect square, then one expects some cancellation in $\sum_{p<x}\left(\frac{a}{p}\righ …
- 671