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 |
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
183
views
inequality for sum $\sum_{j_{i}=1,i=1,\cdots,k}^{n}\gcd(j_{1},j_{2},\cdots,j_{k})$
if $n>k>1$ be postive integer,show that
$$S_{k}(n)=\dfrac{1}{n^k}\sum_{j_{1}=1}^{n}\sum_{j_{2}=1}^{n}\cdots\sum_{j_{k}=1}^{n}\gcd(j_{1},j_{2},\cdots,j_{k})\le\dfrac{\zeta(k-1)}{\zeta(k)} \tag{1}$$
…
13
votes
2
answers
688
views
Show that there exist $k\in\{1,2,\cdots,n\}$ such that $\frac{1}{n}\sum_{i=1}^{n}\left(\{kx_...
The following question has post mathsatck :Nice problem, perhaps from a question of expectation.The problem seemed so elementary, but I had tried to solve it for a long time and eventually failed.I 'd …