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 31105
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.
4
votes
1
answer
352
views
Power free values of reducible polynomials
Browning in this paper proves that if $f \in \mathbb{Z}[x]$ is an irreducible polynomial of degree $d \geq 3$ and $k$ is an integer $\geq 3d/4 + 1/4$, then we have $$\#\{n \in \mathbb{Z} \cap [1, X] …
- 73