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 476460
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
277
views
Rough numbers in short interval
A positive integer $n$ is called $k$-rough if all of the prime factors of $n$ strictly exceed $k$.
For $k$ fixed and $n$ large, what's the shortest interval $[n,n+t]$ that contains a $k$-rough number …
- 43
0
votes
0
answers
135
views
An estimate of a sum
I'm looking for an estimate of this sum $\sum_{n\leq x} \frac{\mu^2(n)}{\varphi(n)}$ where $\mu$ is the Möbius function and $\varphi$ the Euler's totient function.
Thanks a lot.
- 43
0
votes
0
answers
84
views
Cardinality of a subset of smooth numbers
Recall: An $n$-smooth number is an integer whose prime factors are all less than or equal to $n$.
Let $k$ and $N$ two integers with $0\leq k\leq N$. Let's put $H= \{n\in[0,N]\ s.t.\ n\ is\ k-smooth\} …
- 43