About the limit $lim_n to +infty frac1n^2 sum_1 le a,b le n frac1 mathrmgcd (a,b) $Interesting phenomenon with the $zeta(3)$ seriesTo what extent are divisibility by different primes independent?System of congruences that do not satisfy CRT assumptions (via algorithm)Is the limit of a Dirichlet series to infinity always equal to the constant term?Practical probability that the GCD of a set of large, random integers is 1?About the differentiability of $sum_n=1^inftyfracmu(n)sin(sqrt2n^3x)sqrt2n^3e^-isqrtn^3x$On a limit involving $sum_n=1^inftyfracsin(sqrtn^3+1x)sqrtn^3+1$On the equation $(sigma(ab))^2=2a^2(sigma(b))^2+2b^2(sigma(a))^2$, for integers $1<a<b$Estimate median of Cauchy distributionAnomaly in probability of 3 randomly-selected integers being coprime

How does residential electricity work?

What is the opposite of 'gravitas'?

Why Were Madagascar and New Zealand Discovered So Late?

HashMap containsKey() returns false although hashCode() and equals() are true

Mapping a list into a phase plot

Transcription Beats per minute

Have I saved too much for retirement so far?

Everything Bob says is false. How does he get people to trust him?

apt-get update is failing in debian

What's a natural way to say that someone works somewhere (for a job)?

Lay out the Carpet

Can somebody explain Brexit in a few child-proof sentences?

Can I Retrieve Email Addresses from BCC?

What's the purpose of "true" in bash "if sudo true; then"

There is only s̶i̶x̶t̶y one place he can be

Do I need a multiple entry visa for a trip UK -> Sweden -> UK?

Bash method for viewing beginning and end of file

Cynical novel that describes an America ruled by the media, arms manufacturers, and ethnic figureheads

Modify casing of marked letters

The plural of 'stomach"

Best way to store options for panels

Are there any comparative studies done between Ashtavakra Gita and Buddhim?

How does a character multiclassing into warlock get a focus?

What is difference between behavior and behaviour



About the limit $lim_n to +infty frac1n^2 sum_1 le a,b le n frac1 mathrmgcd (a,b) $


Interesting phenomenon with the $zeta(3)$ seriesTo what extent are divisibility by different primes independent?System of congruences that do not satisfy CRT assumptions (via algorithm)Is the limit of a Dirichlet series to infinity always equal to the constant term?Practical probability that the GCD of a set of large, random integers is 1?About the differentiability of $sum_n=1^inftyfracmu(n)sin(sqrt2n^3x)sqrt2n^3e^-isqrtn^3x$On a limit involving $sum_n=1^inftyfracsin(sqrtn^3+1x)sqrtn^3+1$On the equation $(sigma(ab))^2=2a^2(sigma(b))^2+2b^2(sigma(a))^2$, for integers $1<a<b$Estimate median of Cauchy distributionAnomaly in probability of 3 randomly-selected integers being coprime













3












$begingroup$


This is not homework.



My question is:




Prove or disprove: $$lim_n to +infty frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) = fraczeta(3)zeta(2)$$




This would represent the probability as $n to +infty$ that, after having picked randomly $a,b,c in 1, dots ,n $, the line
$$ax+by+c=0$$
has some integer coordinate point $(x,y in Bbb Z^2)$. Indeed, fixed $a,b in 1, dots ,n $, then $c=-ax-by$ for some $x,y in Bbb Z$ is equivalent to $$c mathrm is a multiple of gcd(a,b)$$
because of Bezout identity; this event happens with probability $1/gcd (a,b)$.



What I tried first: clearly
$$0 le frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) le frac1n^2 sum_a,b=1^n 1 = 1$$
so, our limit belongs to $[0,1]$ (if it exists).



Then I made some euristic argument:



I know that the probability, as $n to +infty$, that two random numbers $a,bin 1, dots ,n $ are coprime is $$zeta(2)^-1 = frac6pi^2,$$ thus the probability that $gcd(a,b)=d$ is equal to
$$fraczeta(2)^-1d^2 = frac6d^2pi^2$$
Thus our probability is (and here is where I have doubts in my argument)
$$sum_d=1^n fraczeta(2)^-1d^2 to frac1zeta(2) cdot zeta(2) =1$$



EDIT: or maybe my last step should be
$$sum_d=1^n fraczeta(2)^-1d^2 frac1d to fraczeta(3)zeta(2)$$










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    The limit cannot be $1$ since for each $n$, there are at least $frac(n-1)^24$ pairs of even numbers $a,b$ with $textgcd(a,b)ge 2$. So the limit is at most $1cdot frac 3 4+frac 12 frac 14 =frac 7 8.$
    $endgroup$
    – Song
    Mar 17 at 11:32















3












$begingroup$


This is not homework.



My question is:




Prove or disprove: $$lim_n to +infty frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) = fraczeta(3)zeta(2)$$




This would represent the probability as $n to +infty$ that, after having picked randomly $a,b,c in 1, dots ,n $, the line
$$ax+by+c=0$$
has some integer coordinate point $(x,y in Bbb Z^2)$. Indeed, fixed $a,b in 1, dots ,n $, then $c=-ax-by$ for some $x,y in Bbb Z$ is equivalent to $$c mathrm is a multiple of gcd(a,b)$$
because of Bezout identity; this event happens with probability $1/gcd (a,b)$.



What I tried first: clearly
$$0 le frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) le frac1n^2 sum_a,b=1^n 1 = 1$$
so, our limit belongs to $[0,1]$ (if it exists).



Then I made some euristic argument:



I know that the probability, as $n to +infty$, that two random numbers $a,bin 1, dots ,n $ are coprime is $$zeta(2)^-1 = frac6pi^2,$$ thus the probability that $gcd(a,b)=d$ is equal to
$$fraczeta(2)^-1d^2 = frac6d^2pi^2$$
Thus our probability is (and here is where I have doubts in my argument)
$$sum_d=1^n fraczeta(2)^-1d^2 to frac1zeta(2) cdot zeta(2) =1$$



EDIT: or maybe my last step should be
$$sum_d=1^n fraczeta(2)^-1d^2 frac1d to fraczeta(3)zeta(2)$$










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    The limit cannot be $1$ since for each $n$, there are at least $frac(n-1)^24$ pairs of even numbers $a,b$ with $textgcd(a,b)ge 2$. So the limit is at most $1cdot frac 3 4+frac 12 frac 14 =frac 7 8.$
    $endgroup$
    – Song
    Mar 17 at 11:32













3












3








3


0



$begingroup$


This is not homework.



My question is:




Prove or disprove: $$lim_n to +infty frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) = fraczeta(3)zeta(2)$$




This would represent the probability as $n to +infty$ that, after having picked randomly $a,b,c in 1, dots ,n $, the line
$$ax+by+c=0$$
has some integer coordinate point $(x,y in Bbb Z^2)$. Indeed, fixed $a,b in 1, dots ,n $, then $c=-ax-by$ for some $x,y in Bbb Z$ is equivalent to $$c mathrm is a multiple of gcd(a,b)$$
because of Bezout identity; this event happens with probability $1/gcd (a,b)$.



What I tried first: clearly
$$0 le frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) le frac1n^2 sum_a,b=1^n 1 = 1$$
so, our limit belongs to $[0,1]$ (if it exists).



Then I made some euristic argument:



I know that the probability, as $n to +infty$, that two random numbers $a,bin 1, dots ,n $ are coprime is $$zeta(2)^-1 = frac6pi^2,$$ thus the probability that $gcd(a,b)=d$ is equal to
$$fraczeta(2)^-1d^2 = frac6d^2pi^2$$
Thus our probability is (and here is where I have doubts in my argument)
$$sum_d=1^n fraczeta(2)^-1d^2 to frac1zeta(2) cdot zeta(2) =1$$



EDIT: or maybe my last step should be
$$sum_d=1^n fraczeta(2)^-1d^2 frac1d to fraczeta(3)zeta(2)$$










share|cite|improve this question











$endgroup$




This is not homework.



My question is:




Prove or disprove: $$lim_n to +infty frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) = fraczeta(3)zeta(2)$$




This would represent the probability as $n to +infty$ that, after having picked randomly $a,b,c in 1, dots ,n $, the line
$$ax+by+c=0$$
has some integer coordinate point $(x,y in Bbb Z^2)$. Indeed, fixed $a,b in 1, dots ,n $, then $c=-ax-by$ for some $x,y in Bbb Z$ is equivalent to $$c mathrm is a multiple of gcd(a,b)$$
because of Bezout identity; this event happens with probability $1/gcd (a,b)$.



What I tried first: clearly
$$0 le frac1n^2 sum_a,b=1^n frac1 mathrmgcd (a,b) le frac1n^2 sum_a,b=1^n 1 = 1$$
so, our limit belongs to $[0,1]$ (if it exists).



Then I made some euristic argument:



I know that the probability, as $n to +infty$, that two random numbers $a,bin 1, dots ,n $ are coprime is $$zeta(2)^-1 = frac6pi^2,$$ thus the probability that $gcd(a,b)=d$ is equal to
$$fraczeta(2)^-1d^2 = frac6d^2pi^2$$
Thus our probability is (and here is where I have doubts in my argument)
$$sum_d=1^n fraczeta(2)^-1d^2 to frac1zeta(2) cdot zeta(2) =1$$



EDIT: or maybe my last step should be
$$sum_d=1^n fraczeta(2)^-1d^2 frac1d to fraczeta(3)zeta(2)$$







number-theory limits greatest-common-divisor probability-limit-theorems






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 17 at 11:45







Crostul

















asked Mar 17 at 10:57









CrostulCrostul

28.1k22352




28.1k22352







  • 2




    $begingroup$
    The limit cannot be $1$ since for each $n$, there are at least $frac(n-1)^24$ pairs of even numbers $a,b$ with $textgcd(a,b)ge 2$. So the limit is at most $1cdot frac 3 4+frac 12 frac 14 =frac 7 8.$
    $endgroup$
    – Song
    Mar 17 at 11:32












  • 2




    $begingroup$
    The limit cannot be $1$ since for each $n$, there are at least $frac(n-1)^24$ pairs of even numbers $a,b$ with $textgcd(a,b)ge 2$. So the limit is at most $1cdot frac 3 4+frac 12 frac 14 =frac 7 8.$
    $endgroup$
    – Song
    Mar 17 at 11:32







2




2




$begingroup$
The limit cannot be $1$ since for each $n$, there are at least $frac(n-1)^24$ pairs of even numbers $a,b$ with $textgcd(a,b)ge 2$. So the limit is at most $1cdot frac 3 4+frac 12 frac 14 =frac 7 8.$
$endgroup$
– Song
Mar 17 at 11:32




$begingroup$
The limit cannot be $1$ since for each $n$, there are at least $frac(n-1)^24$ pairs of even numbers $a,b$ with $textgcd(a,b)ge 2$. So the limit is at most $1cdot frac 3 4+frac 12 frac 14 =frac 7 8.$
$endgroup$
– Song
Mar 17 at 11:32










2 Answers
2






active

oldest

votes


















1












$begingroup$

There is no need to involve probabilities, just a bit of analytic number theory suffices. I don't know how familiar you are with $L$-functions, so I'll leave some details open for now. If any part needs clarification, let me know.



For every positive integer $n$ define
$$f(n):=sum_a,b=1^nfrac1gcd(a,b)
qquadtext and qquad
g(n):=sum_dmid nfracvarphi(tfracnd)d$$
so that for all $n>1$ we have
begineqnarray*
f(n)-f(n-1)
&=&-frac1n+2sum_c=1^nfrac1gcd(c,n)\
&=&-frac1n+2sum_dmid nfracvarphi(tfracnd)d\
&=&-frac1n+2g(n).
endeqnarray*

Because $lim_ntoinftyfrac1n^2sum_k=1^n-frac1k$, this already shows that
$$lim_ntoinftyfrac1n^2f(n)=2lim_ntoinftyfrac1n^2sum_k=1^ng(n).$$
Note that $g$ is a multiplicative function, and in fact $g=iotaastvarphi$ where $iota(n):=tfrac1n$. This immediately shows that the $L$-function associated to $g$ converges for all $sinBbbC$ with $operatornameRe(s)>2$ and that for all such $sinBbbC$ we have
$$L_g(s)=L_iota(s)L_varphi(s)=zeta(s+1)L_varphi(s).$$
Then by a Tauberian theorem, for example Wiener-Ikehara, we have
begineqnarray*
lim_ntoinftyfrac1n^2f(n)
&=&2operatornameRes(L_g,2)\
&=&2cdotoperatornameRes(zeta(s+1),2)cdotoperatornameRes(L_varphi,2)\
&=&2cdotzeta(3)cdotfrac12zeta(2)\
&=&fraczeta(3)zeta(2).
endeqnarray*






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Not familiar with $L$-functions at all. Anyway, thanks for your answer.
    $endgroup$
    – Crostul
    Mar 19 at 23:25


















2












$begingroup$

Your doubts are justified: $sum_d=1^n fraczeta(2)^-1d^2$ is just a sum of limiting probabilities, so it should (and does) yield $1$ in the limit. The sum you want to compute is of values of $frac1gcd(a,b)$, so you need to weight the possible values of that expression by their probabilities. This gives
$$
sum_d=1^n fraczeta(2)^-1d^2cdotfrac1dtofraczeta(3)zeta(2)approx 0.730763
$$

A numerical experimentat (with $n=1000$) gives a result close to $0.731$, so this seems likely to be correct.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Thank you for your answer! Indeed I was having doubts while writing my question. Anyway, this is just heuristics, now what I'm looking for is a proof.
    $endgroup$
    – Crostul
    Mar 17 at 11:23










Your Answer





StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3151400%2fabout-the-limit-lim-n-to-infty-frac1n2-sum-1-le-a-b-le-n-frac%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

There is no need to involve probabilities, just a bit of analytic number theory suffices. I don't know how familiar you are with $L$-functions, so I'll leave some details open for now. If any part needs clarification, let me know.



For every positive integer $n$ define
$$f(n):=sum_a,b=1^nfrac1gcd(a,b)
qquadtext and qquad
g(n):=sum_dmid nfracvarphi(tfracnd)d$$
so that for all $n>1$ we have
begineqnarray*
f(n)-f(n-1)
&=&-frac1n+2sum_c=1^nfrac1gcd(c,n)\
&=&-frac1n+2sum_dmid nfracvarphi(tfracnd)d\
&=&-frac1n+2g(n).
endeqnarray*

Because $lim_ntoinftyfrac1n^2sum_k=1^n-frac1k$, this already shows that
$$lim_ntoinftyfrac1n^2f(n)=2lim_ntoinftyfrac1n^2sum_k=1^ng(n).$$
Note that $g$ is a multiplicative function, and in fact $g=iotaastvarphi$ where $iota(n):=tfrac1n$. This immediately shows that the $L$-function associated to $g$ converges for all $sinBbbC$ with $operatornameRe(s)>2$ and that for all such $sinBbbC$ we have
$$L_g(s)=L_iota(s)L_varphi(s)=zeta(s+1)L_varphi(s).$$
Then by a Tauberian theorem, for example Wiener-Ikehara, we have
begineqnarray*
lim_ntoinftyfrac1n^2f(n)
&=&2operatornameRes(L_g,2)\
&=&2cdotoperatornameRes(zeta(s+1),2)cdotoperatornameRes(L_varphi,2)\
&=&2cdotzeta(3)cdotfrac12zeta(2)\
&=&fraczeta(3)zeta(2).
endeqnarray*






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Not familiar with $L$-functions at all. Anyway, thanks for your answer.
    $endgroup$
    – Crostul
    Mar 19 at 23:25















1












$begingroup$

There is no need to involve probabilities, just a bit of analytic number theory suffices. I don't know how familiar you are with $L$-functions, so I'll leave some details open for now. If any part needs clarification, let me know.



For every positive integer $n$ define
$$f(n):=sum_a,b=1^nfrac1gcd(a,b)
qquadtext and qquad
g(n):=sum_dmid nfracvarphi(tfracnd)d$$
so that for all $n>1$ we have
begineqnarray*
f(n)-f(n-1)
&=&-frac1n+2sum_c=1^nfrac1gcd(c,n)\
&=&-frac1n+2sum_dmid nfracvarphi(tfracnd)d\
&=&-frac1n+2g(n).
endeqnarray*

Because $lim_ntoinftyfrac1n^2sum_k=1^n-frac1k$, this already shows that
$$lim_ntoinftyfrac1n^2f(n)=2lim_ntoinftyfrac1n^2sum_k=1^ng(n).$$
Note that $g$ is a multiplicative function, and in fact $g=iotaastvarphi$ where $iota(n):=tfrac1n$. This immediately shows that the $L$-function associated to $g$ converges for all $sinBbbC$ with $operatornameRe(s)>2$ and that for all such $sinBbbC$ we have
$$L_g(s)=L_iota(s)L_varphi(s)=zeta(s+1)L_varphi(s).$$
Then by a Tauberian theorem, for example Wiener-Ikehara, we have
begineqnarray*
lim_ntoinftyfrac1n^2f(n)
&=&2operatornameRes(L_g,2)\
&=&2cdotoperatornameRes(zeta(s+1),2)cdotoperatornameRes(L_varphi,2)\
&=&2cdotzeta(3)cdotfrac12zeta(2)\
&=&fraczeta(3)zeta(2).
endeqnarray*






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Not familiar with $L$-functions at all. Anyway, thanks for your answer.
    $endgroup$
    – Crostul
    Mar 19 at 23:25













1












1








1





$begingroup$

There is no need to involve probabilities, just a bit of analytic number theory suffices. I don't know how familiar you are with $L$-functions, so I'll leave some details open for now. If any part needs clarification, let me know.



For every positive integer $n$ define
$$f(n):=sum_a,b=1^nfrac1gcd(a,b)
qquadtext and qquad
g(n):=sum_dmid nfracvarphi(tfracnd)d$$
so that for all $n>1$ we have
begineqnarray*
f(n)-f(n-1)
&=&-frac1n+2sum_c=1^nfrac1gcd(c,n)\
&=&-frac1n+2sum_dmid nfracvarphi(tfracnd)d\
&=&-frac1n+2g(n).
endeqnarray*

Because $lim_ntoinftyfrac1n^2sum_k=1^n-frac1k$, this already shows that
$$lim_ntoinftyfrac1n^2f(n)=2lim_ntoinftyfrac1n^2sum_k=1^ng(n).$$
Note that $g$ is a multiplicative function, and in fact $g=iotaastvarphi$ where $iota(n):=tfrac1n$. This immediately shows that the $L$-function associated to $g$ converges for all $sinBbbC$ with $operatornameRe(s)>2$ and that for all such $sinBbbC$ we have
$$L_g(s)=L_iota(s)L_varphi(s)=zeta(s+1)L_varphi(s).$$
Then by a Tauberian theorem, for example Wiener-Ikehara, we have
begineqnarray*
lim_ntoinftyfrac1n^2f(n)
&=&2operatornameRes(L_g,2)\
&=&2cdotoperatornameRes(zeta(s+1),2)cdotoperatornameRes(L_varphi,2)\
&=&2cdotzeta(3)cdotfrac12zeta(2)\
&=&fraczeta(3)zeta(2).
endeqnarray*






share|cite|improve this answer









$endgroup$



There is no need to involve probabilities, just a bit of analytic number theory suffices. I don't know how familiar you are with $L$-functions, so I'll leave some details open for now. If any part needs clarification, let me know.



For every positive integer $n$ define
$$f(n):=sum_a,b=1^nfrac1gcd(a,b)
qquadtext and qquad
g(n):=sum_dmid nfracvarphi(tfracnd)d$$
so that for all $n>1$ we have
begineqnarray*
f(n)-f(n-1)
&=&-frac1n+2sum_c=1^nfrac1gcd(c,n)\
&=&-frac1n+2sum_dmid nfracvarphi(tfracnd)d\
&=&-frac1n+2g(n).
endeqnarray*

Because $lim_ntoinftyfrac1n^2sum_k=1^n-frac1k$, this already shows that
$$lim_ntoinftyfrac1n^2f(n)=2lim_ntoinftyfrac1n^2sum_k=1^ng(n).$$
Note that $g$ is a multiplicative function, and in fact $g=iotaastvarphi$ where $iota(n):=tfrac1n$. This immediately shows that the $L$-function associated to $g$ converges for all $sinBbbC$ with $operatornameRe(s)>2$ and that for all such $sinBbbC$ we have
$$L_g(s)=L_iota(s)L_varphi(s)=zeta(s+1)L_varphi(s).$$
Then by a Tauberian theorem, for example Wiener-Ikehara, we have
begineqnarray*
lim_ntoinftyfrac1n^2f(n)
&=&2operatornameRes(L_g,2)\
&=&2cdotoperatornameRes(zeta(s+1),2)cdotoperatornameRes(L_varphi,2)\
&=&2cdotzeta(3)cdotfrac12zeta(2)\
&=&fraczeta(3)zeta(2).
endeqnarray*







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Mar 19 at 21:00









ServaesServaes

28.5k34099




28.5k34099











  • $begingroup$
    Not familiar with $L$-functions at all. Anyway, thanks for your answer.
    $endgroup$
    – Crostul
    Mar 19 at 23:25
















  • $begingroup$
    Not familiar with $L$-functions at all. Anyway, thanks for your answer.
    $endgroup$
    – Crostul
    Mar 19 at 23:25















$begingroup$
Not familiar with $L$-functions at all. Anyway, thanks for your answer.
$endgroup$
– Crostul
Mar 19 at 23:25




$begingroup$
Not familiar with $L$-functions at all. Anyway, thanks for your answer.
$endgroup$
– Crostul
Mar 19 at 23:25











2












$begingroup$

Your doubts are justified: $sum_d=1^n fraczeta(2)^-1d^2$ is just a sum of limiting probabilities, so it should (and does) yield $1$ in the limit. The sum you want to compute is of values of $frac1gcd(a,b)$, so you need to weight the possible values of that expression by their probabilities. This gives
$$
sum_d=1^n fraczeta(2)^-1d^2cdotfrac1dtofraczeta(3)zeta(2)approx 0.730763
$$

A numerical experimentat (with $n=1000$) gives a result close to $0.731$, so this seems likely to be correct.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Thank you for your answer! Indeed I was having doubts while writing my question. Anyway, this is just heuristics, now what I'm looking for is a proof.
    $endgroup$
    – Crostul
    Mar 17 at 11:23















2












$begingroup$

Your doubts are justified: $sum_d=1^n fraczeta(2)^-1d^2$ is just a sum of limiting probabilities, so it should (and does) yield $1$ in the limit. The sum you want to compute is of values of $frac1gcd(a,b)$, so you need to weight the possible values of that expression by their probabilities. This gives
$$
sum_d=1^n fraczeta(2)^-1d^2cdotfrac1dtofraczeta(3)zeta(2)approx 0.730763
$$

A numerical experimentat (with $n=1000$) gives a result close to $0.731$, so this seems likely to be correct.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Thank you for your answer! Indeed I was having doubts while writing my question. Anyway, this is just heuristics, now what I'm looking for is a proof.
    $endgroup$
    – Crostul
    Mar 17 at 11:23













2












2








2





$begingroup$

Your doubts are justified: $sum_d=1^n fraczeta(2)^-1d^2$ is just a sum of limiting probabilities, so it should (and does) yield $1$ in the limit. The sum you want to compute is of values of $frac1gcd(a,b)$, so you need to weight the possible values of that expression by their probabilities. This gives
$$
sum_d=1^n fraczeta(2)^-1d^2cdotfrac1dtofraczeta(3)zeta(2)approx 0.730763
$$

A numerical experimentat (with $n=1000$) gives a result close to $0.731$, so this seems likely to be correct.






share|cite|improve this answer









$endgroup$



Your doubts are justified: $sum_d=1^n fraczeta(2)^-1d^2$ is just a sum of limiting probabilities, so it should (and does) yield $1$ in the limit. The sum you want to compute is of values of $frac1gcd(a,b)$, so you need to weight the possible values of that expression by their probabilities. This gives
$$
sum_d=1^n fraczeta(2)^-1d^2cdotfrac1dtofraczeta(3)zeta(2)approx 0.730763
$$

A numerical experimentat (with $n=1000$) gives a result close to $0.731$, so this seems likely to be correct.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Mar 17 at 11:18









FredHFredH

2,9141021




2,9141021











  • $begingroup$
    Thank you for your answer! Indeed I was having doubts while writing my question. Anyway, this is just heuristics, now what I'm looking for is a proof.
    $endgroup$
    – Crostul
    Mar 17 at 11:23
















  • $begingroup$
    Thank you for your answer! Indeed I was having doubts while writing my question. Anyway, this is just heuristics, now what I'm looking for is a proof.
    $endgroup$
    – Crostul
    Mar 17 at 11:23















$begingroup$
Thank you for your answer! Indeed I was having doubts while writing my question. Anyway, this is just heuristics, now what I'm looking for is a proof.
$endgroup$
– Crostul
Mar 17 at 11:23




$begingroup$
Thank you for your answer! Indeed I was having doubts while writing my question. Anyway, this is just heuristics, now what I'm looking for is a proof.
$endgroup$
– Crostul
Mar 17 at 11:23

















draft saved

draft discarded
















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3151400%2fabout-the-limit-lim-n-to-infty-frac1n2-sum-1-le-a-b-le-n-frac%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Moe incest case Sentencing See also References Navigation menu"'Australian Josef Fritzl' fathered four children by daughter""Small town recoils in horror at 'Australian Fritzl' incest case""Victorian rape allegations echo Fritzl case - Just In (Australian Broadcasting Corporation)""Incest father jailed for 22 years""'Australian Fritzl' sentenced to 22 years in prison for abusing daughter for three decades""RSJ v The Queen"

Who is our nearest planetary neighbor, on average?Santa Claus flies to the South PoleSeven Spheres of Unequal Mass, a weighing problem with a twistDescribe a large integerFast Mental Calculation of $7.5^7$Math in Space (without the help of celebrities)Find the value of $bigstar$: Puzzle 8 - InequalityWho drinks beer while running anyway?A Crucial DeliveryRanking And AverageHow long will my money last at roulette?

Daza language Contents Vocabulary Phonology References External links Navigation menudaza1242Daza"Dazaga"eeee178086576