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 questions only
not deleted
user 505902
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
8
votes
2
answers
308
views
Asymptotics on sum of n/rad(n) [duplicate]
I'm interested in asymptotics for the sum
$$\sum_{n\le x}\frac{n}{\text{rad}(n)}.$$
For my research I only need to know whether or not this is $\mathcal{O}(x)$, but I would appreciate more precise asy …
- 375
6
votes
2
answers
533
views
Number of divisors which are at most $n$
I’m interested in the function $\tau_n:\mathbb{N}\to\{1,2,3,\cdots, n\}$ defined by
$$\tau_n(x)=\sum_{k=1}^n \mathbf{1}_{k\mid x},$$
the number of divisors of $x$ which are at most $n$. Question 6 of …
- 375