Probability of a fraction $a/b$ that cannot be simplified [closed]On the probability that two positive integers are relatively primeprobability of at least a fraction of bins contain a fixed number of ballsProbability that two random integers have only one prime factor in commonProbability with Discrete Random VariableAbsolute difference and probabilityFinding the probability of a fraction being in lowest terms.Finding out probability that the last digit of a product is 5Can't compute the integral in this probabilityOut of $50$ consecutive numbers, what is the probability that the absolute difference between the two numbers is $10$ or less?What is the probability to pick a fraction that cannot be reduced?

How can I list the different hex characters between two files?

Professor Roman loves to teach unorthodox Chemistry

Are the guests in Westworld forbidden to tell the hosts that they are robots?

Why is it bad to use your whole foot in rock climbing

What plausible reason could I give for my FTL drive only working in space

In The Incredibles 2, why does Screenslaver's name use a pun on something that doesn't exist in the 1950s pastiche?

In Pandemic, why take the extra step of eradicating a disease after you've cured it?

What exactly "triggers an additional time" in the interaction between Afterlife and Teysa Karlov?

How many sets of dice do I need for D&D?

How to Handle Many Times Series Simultaneously?

How can I find out about the game world without meta-influencing it?

Part of my house is inexplicably gone

Dedicated bike GPS computer over smartphone

Was planting UN flag on Moon ever discussed?

What is the "books received" section in journals?

ASCII Meme Arrow Generator

Is Jesus the last Prophet?

How can powerful telekinesis avoid violating Newton's 3rd Law?

Labels still showing when no Label Features turned on in ArcMap?

Was self-modifying code possible using BASIC?

Is all-caps blackletter no longer taboo?

Why did Robert pick unworthy men for the White Cloaks?

Make Gimbap cutter

How to make a composition of functions prettier?



Probability of a fraction $a/b$ that cannot be simplified [closed]


On the probability that two positive integers are relatively primeprobability of at least a fraction of bins contain a fixed number of ballsProbability that two random integers have only one prime factor in commonProbability with Discrete Random VariableAbsolute difference and probabilityFinding the probability of a fraction being in lowest terms.Finding out probability that the last digit of a product is 5Can't compute the integral in this probabilityOut of $50$ consecutive numbers, what is the probability that the absolute difference between the two numbers is $10$ or less?What is the probability to pick a fraction that cannot be reduced?













11












$begingroup$


Let a and b be random independent positive integers. What is the probability that the fraction:



$fracab$



cannot be simplified?










share|cite|improve this question











$endgroup$



closed as off-topic by TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會 May 28 at 23:32


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會
If this question can be reworded to fit the rules in the help center, please edit the question.















  • $begingroup$
    That's equal to the probability that $gcd(a,b)=1$. Since prime numbers follow a $log$ distribution, I think that the probability must be zero in the end.
    $endgroup$
    – RMWGNE96
    May 27 at 20:22






  • 13




    $begingroup$
    There is no uniform distribution on positive integers. What is true is that if $a$ and $b$ are chosen independently from the uniform distribution on $1,2,ldots, N$, then asymptotically as $N to infty$ the probability approaches $6/pi^2$.
    $endgroup$
    – Robert Israel
    May 27 at 20:27






  • 1




    $begingroup$
    Here is a video of a mathematician doing this very problem with dice and explaining the maths: youtube.com/watch?v=RZBhSi_PwHU
    $endgroup$
    – Jon Rose
    May 28 at 8:13















11












$begingroup$


Let a and b be random independent positive integers. What is the probability that the fraction:



$fracab$



cannot be simplified?










share|cite|improve this question











$endgroup$



closed as off-topic by TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會 May 28 at 23:32


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會
If this question can be reworded to fit the rules in the help center, please edit the question.















  • $begingroup$
    That's equal to the probability that $gcd(a,b)=1$. Since prime numbers follow a $log$ distribution, I think that the probability must be zero in the end.
    $endgroup$
    – RMWGNE96
    May 27 at 20:22






  • 13




    $begingroup$
    There is no uniform distribution on positive integers. What is true is that if $a$ and $b$ are chosen independently from the uniform distribution on $1,2,ldots, N$, then asymptotically as $N to infty$ the probability approaches $6/pi^2$.
    $endgroup$
    – Robert Israel
    May 27 at 20:27






  • 1




    $begingroup$
    Here is a video of a mathematician doing this very problem with dice and explaining the maths: youtube.com/watch?v=RZBhSi_PwHU
    $endgroup$
    – Jon Rose
    May 28 at 8:13













11












11








11


5



$begingroup$


Let a and b be random independent positive integers. What is the probability that the fraction:



$fracab$



cannot be simplified?










share|cite|improve this question











$endgroup$




Let a and b be random independent positive integers. What is the probability that the fraction:



$fracab$



cannot be simplified?







probability number-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jun 5 at 15:21







michail vazaios

















asked May 27 at 20:20









michail vazaiosmichail vazaios

1809




1809




closed as off-topic by TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會 May 28 at 23:32


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會
If this question can be reworded to fit the rules in the help center, please edit the question.







closed as off-topic by TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會 May 28 at 23:32


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – TheSimpliFire, Jendrik Stelzner, Adrian Keister, Aweygan, GNUSupporter 8964民主女神 地下教會
If this question can be reworded to fit the rules in the help center, please edit the question.











  • $begingroup$
    That's equal to the probability that $gcd(a,b)=1$. Since prime numbers follow a $log$ distribution, I think that the probability must be zero in the end.
    $endgroup$
    – RMWGNE96
    May 27 at 20:22






  • 13




    $begingroup$
    There is no uniform distribution on positive integers. What is true is that if $a$ and $b$ are chosen independently from the uniform distribution on $1,2,ldots, N$, then asymptotically as $N to infty$ the probability approaches $6/pi^2$.
    $endgroup$
    – Robert Israel
    May 27 at 20:27






  • 1




    $begingroup$
    Here is a video of a mathematician doing this very problem with dice and explaining the maths: youtube.com/watch?v=RZBhSi_PwHU
    $endgroup$
    – Jon Rose
    May 28 at 8:13
















  • $begingroup$
    That's equal to the probability that $gcd(a,b)=1$. Since prime numbers follow a $log$ distribution, I think that the probability must be zero in the end.
    $endgroup$
    – RMWGNE96
    May 27 at 20:22






  • 13




    $begingroup$
    There is no uniform distribution on positive integers. What is true is that if $a$ and $b$ are chosen independently from the uniform distribution on $1,2,ldots, N$, then asymptotically as $N to infty$ the probability approaches $6/pi^2$.
    $endgroup$
    – Robert Israel
    May 27 at 20:27






  • 1




    $begingroup$
    Here is a video of a mathematician doing this very problem with dice and explaining the maths: youtube.com/watch?v=RZBhSi_PwHU
    $endgroup$
    – Jon Rose
    May 28 at 8:13















$begingroup$
That's equal to the probability that $gcd(a,b)=1$. Since prime numbers follow a $log$ distribution, I think that the probability must be zero in the end.
$endgroup$
– RMWGNE96
May 27 at 20:22




$begingroup$
That's equal to the probability that $gcd(a,b)=1$. Since prime numbers follow a $log$ distribution, I think that the probability must be zero in the end.
$endgroup$
– RMWGNE96
May 27 at 20:22




13




13




$begingroup$
There is no uniform distribution on positive integers. What is true is that if $a$ and $b$ are chosen independently from the uniform distribution on $1,2,ldots, N$, then asymptotically as $N to infty$ the probability approaches $6/pi^2$.
$endgroup$
– Robert Israel
May 27 at 20:27




$begingroup$
There is no uniform distribution on positive integers. What is true is that if $a$ and $b$ are chosen independently from the uniform distribution on $1,2,ldots, N$, then asymptotically as $N to infty$ the probability approaches $6/pi^2$.
$endgroup$
– Robert Israel
May 27 at 20:27




1




1




$begingroup$
Here is a video of a mathematician doing this very problem with dice and explaining the maths: youtube.com/watch?v=RZBhSi_PwHU
$endgroup$
– Jon Rose
May 28 at 8:13




$begingroup$
Here is a video of a mathematician doing this very problem with dice and explaining the maths: youtube.com/watch?v=RZBhSi_PwHU
$endgroup$
– Jon Rose
May 28 at 8:13










2 Answers
2






active

oldest

votes


















19












$begingroup$

Peter's answer gets to the heart of the matter relatively quickly, but I feel it would also be best to demonstrate where the $6/pi^2$ comes from, seemingly out of nowhere to the uninitiated.



So, it should be obvious that $a/b$ is in simplest form if and only if $a,b$ are coprime, i.e. $gcd(a,b) = 1$. Well, what does that mean? It means that $a,b$ share no common prime number factors.



In particular, it means $a,b$ do not share a factor of $2$. For (uniformly randomly chosen) nonzero integers $a,b$ (less than some other number $x$), there is a $1/2$ chance (in the limit $x to infty$) each will have a factor of $2$. Thus,



$$P(texta,b do not have a mutual factor of 2) = 1 - left(frac 1 2 right)^2$$



Similarly, it means that they do not share a factor of $3$. There's a $1/3$ chance each will have a factor of three, and thus,



$$P(texta,b do not have a mutual factor of 3) = 1 - left(frac 1 3 right)^2$$



This clearly generalizes. Consider a prime number $p$. There is a $1/p$ chance that $a,b$ each will have it, and in turn



$$P(texta,b do not have a mutual factor of p) = 1 - left(frac 1 p right)^2$$



For $a,b$ to be coprime this needs to be true of all primes $p$. The events are independent, and we accordingly can multiply the respective probabilities for each prime $p$, obtaining



$$P(texta,b are coprime) = prod_textp prime 1 - left(frac 1 p right)^2 = prod_textp prime 1 - frac 1 p^2$$



This now ties into something known as the Riemann zeta function. There are two formulas typically associated with it: a summation and a product formula. We often focus on the summation formula but can derive the latter; a proof of said derivation can be found here. In any event, we focus on the prime product formula below:



$$zeta(s) = prod_textp prime frac11-p^-s$$



Bearing in mind this is a product, we can do a manipulation:



$$frac1zeta(s) = prod_textp prime 1-frac 1 p^s$$



This looks precisely like the formula for our probability of $a,b$ being coprime but with $s$ in lieu of $2$. Indeed, letting $s=2$,



$$P(texta,b are coprime) = prod_textp prime 1 - frac1p^2 = frac1zeta(2)$$



$zeta(2)$ is a known value which Euler calculated to be $pi^2/6$; finding this value is often referred to as the Basel problem. Accordingly,



$$P(texta,b are coprime) = frac1pi^2/6 = frac6pi^2$$



The idea also generalizes further. Say you have some group of $n$ integers ($n$ a positive integer). Then the probability that all $n$ are coprime is given by



$$P(textall n numbers are coprime) = frac1zeta(n)$$






share|cite|improve this answer









$endgroup$








  • 2




    $begingroup$
    This same heuristic can be applied to finding the probability that an integer is "$k$-free" (that is, an integer having no perfect $k$th power factor > 1), which also happens to be $frac1zetaleft(kright).$ In fact, the probability that greatest common divisor of $n$ integers has no perfect $k$th power factor > 1 (that is, the probability of $n$ integers being relatively $k$-prime) is $frac1zetaleft(nkright).$
    $endgroup$
    – Brian
    May 27 at 21:14


















6












$begingroup$

This question is equivalent to ask for the probability that $a$ and $b$ are coprime. If $a$ and $b$ are random integers below $x$, then the probability $P(x)$ that $a$ and $b$ are coprime , satisfies $$lim_xrightarrowinfty P(x)=frac6pi^2approx0.6079$$






share|cite|improve this answer









$endgroup$



















    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    19












    $begingroup$

    Peter's answer gets to the heart of the matter relatively quickly, but I feel it would also be best to demonstrate where the $6/pi^2$ comes from, seemingly out of nowhere to the uninitiated.



    So, it should be obvious that $a/b$ is in simplest form if and only if $a,b$ are coprime, i.e. $gcd(a,b) = 1$. Well, what does that mean? It means that $a,b$ share no common prime number factors.



    In particular, it means $a,b$ do not share a factor of $2$. For (uniformly randomly chosen) nonzero integers $a,b$ (less than some other number $x$), there is a $1/2$ chance (in the limit $x to infty$) each will have a factor of $2$. Thus,



    $$P(texta,b do not have a mutual factor of 2) = 1 - left(frac 1 2 right)^2$$



    Similarly, it means that they do not share a factor of $3$. There's a $1/3$ chance each will have a factor of three, and thus,



    $$P(texta,b do not have a mutual factor of 3) = 1 - left(frac 1 3 right)^2$$



    This clearly generalizes. Consider a prime number $p$. There is a $1/p$ chance that $a,b$ each will have it, and in turn



    $$P(texta,b do not have a mutual factor of p) = 1 - left(frac 1 p right)^2$$



    For $a,b$ to be coprime this needs to be true of all primes $p$. The events are independent, and we accordingly can multiply the respective probabilities for each prime $p$, obtaining



    $$P(texta,b are coprime) = prod_textp prime 1 - left(frac 1 p right)^2 = prod_textp prime 1 - frac 1 p^2$$



    This now ties into something known as the Riemann zeta function. There are two formulas typically associated with it: a summation and a product formula. We often focus on the summation formula but can derive the latter; a proof of said derivation can be found here. In any event, we focus on the prime product formula below:



    $$zeta(s) = prod_textp prime frac11-p^-s$$



    Bearing in mind this is a product, we can do a manipulation:



    $$frac1zeta(s) = prod_textp prime 1-frac 1 p^s$$



    This looks precisely like the formula for our probability of $a,b$ being coprime but with $s$ in lieu of $2$. Indeed, letting $s=2$,



    $$P(texta,b are coprime) = prod_textp prime 1 - frac1p^2 = frac1zeta(2)$$



    $zeta(2)$ is a known value which Euler calculated to be $pi^2/6$; finding this value is often referred to as the Basel problem. Accordingly,



    $$P(texta,b are coprime) = frac1pi^2/6 = frac6pi^2$$



    The idea also generalizes further. Say you have some group of $n$ integers ($n$ a positive integer). Then the probability that all $n$ are coprime is given by



    $$P(textall n numbers are coprime) = frac1zeta(n)$$






    share|cite|improve this answer









    $endgroup$








    • 2




      $begingroup$
      This same heuristic can be applied to finding the probability that an integer is "$k$-free" (that is, an integer having no perfect $k$th power factor > 1), which also happens to be $frac1zetaleft(kright).$ In fact, the probability that greatest common divisor of $n$ integers has no perfect $k$th power factor > 1 (that is, the probability of $n$ integers being relatively $k$-prime) is $frac1zetaleft(nkright).$
      $endgroup$
      – Brian
      May 27 at 21:14















    19












    $begingroup$

    Peter's answer gets to the heart of the matter relatively quickly, but I feel it would also be best to demonstrate where the $6/pi^2$ comes from, seemingly out of nowhere to the uninitiated.



    So, it should be obvious that $a/b$ is in simplest form if and only if $a,b$ are coprime, i.e. $gcd(a,b) = 1$. Well, what does that mean? It means that $a,b$ share no common prime number factors.



    In particular, it means $a,b$ do not share a factor of $2$. For (uniformly randomly chosen) nonzero integers $a,b$ (less than some other number $x$), there is a $1/2$ chance (in the limit $x to infty$) each will have a factor of $2$. Thus,



    $$P(texta,b do not have a mutual factor of 2) = 1 - left(frac 1 2 right)^2$$



    Similarly, it means that they do not share a factor of $3$. There's a $1/3$ chance each will have a factor of three, and thus,



    $$P(texta,b do not have a mutual factor of 3) = 1 - left(frac 1 3 right)^2$$



    This clearly generalizes. Consider a prime number $p$. There is a $1/p$ chance that $a,b$ each will have it, and in turn



    $$P(texta,b do not have a mutual factor of p) = 1 - left(frac 1 p right)^2$$



    For $a,b$ to be coprime this needs to be true of all primes $p$. The events are independent, and we accordingly can multiply the respective probabilities for each prime $p$, obtaining



    $$P(texta,b are coprime) = prod_textp prime 1 - left(frac 1 p right)^2 = prod_textp prime 1 - frac 1 p^2$$



    This now ties into something known as the Riemann zeta function. There are two formulas typically associated with it: a summation and a product formula. We often focus on the summation formula but can derive the latter; a proof of said derivation can be found here. In any event, we focus on the prime product formula below:



    $$zeta(s) = prod_textp prime frac11-p^-s$$



    Bearing in mind this is a product, we can do a manipulation:



    $$frac1zeta(s) = prod_textp prime 1-frac 1 p^s$$



    This looks precisely like the formula for our probability of $a,b$ being coprime but with $s$ in lieu of $2$. Indeed, letting $s=2$,



    $$P(texta,b are coprime) = prod_textp prime 1 - frac1p^2 = frac1zeta(2)$$



    $zeta(2)$ is a known value which Euler calculated to be $pi^2/6$; finding this value is often referred to as the Basel problem. Accordingly,



    $$P(texta,b are coprime) = frac1pi^2/6 = frac6pi^2$$



    The idea also generalizes further. Say you have some group of $n$ integers ($n$ a positive integer). Then the probability that all $n$ are coprime is given by



    $$P(textall n numbers are coprime) = frac1zeta(n)$$






    share|cite|improve this answer









    $endgroup$








    • 2




      $begingroup$
      This same heuristic can be applied to finding the probability that an integer is "$k$-free" (that is, an integer having no perfect $k$th power factor > 1), which also happens to be $frac1zetaleft(kright).$ In fact, the probability that greatest common divisor of $n$ integers has no perfect $k$th power factor > 1 (that is, the probability of $n$ integers being relatively $k$-prime) is $frac1zetaleft(nkright).$
      $endgroup$
      – Brian
      May 27 at 21:14













    19












    19








    19





    $begingroup$

    Peter's answer gets to the heart of the matter relatively quickly, but I feel it would also be best to demonstrate where the $6/pi^2$ comes from, seemingly out of nowhere to the uninitiated.



    So, it should be obvious that $a/b$ is in simplest form if and only if $a,b$ are coprime, i.e. $gcd(a,b) = 1$. Well, what does that mean? It means that $a,b$ share no common prime number factors.



    In particular, it means $a,b$ do not share a factor of $2$. For (uniformly randomly chosen) nonzero integers $a,b$ (less than some other number $x$), there is a $1/2$ chance (in the limit $x to infty$) each will have a factor of $2$. Thus,



    $$P(texta,b do not have a mutual factor of 2) = 1 - left(frac 1 2 right)^2$$



    Similarly, it means that they do not share a factor of $3$. There's a $1/3$ chance each will have a factor of three, and thus,



    $$P(texta,b do not have a mutual factor of 3) = 1 - left(frac 1 3 right)^2$$



    This clearly generalizes. Consider a prime number $p$. There is a $1/p$ chance that $a,b$ each will have it, and in turn



    $$P(texta,b do not have a mutual factor of p) = 1 - left(frac 1 p right)^2$$



    For $a,b$ to be coprime this needs to be true of all primes $p$. The events are independent, and we accordingly can multiply the respective probabilities for each prime $p$, obtaining



    $$P(texta,b are coprime) = prod_textp prime 1 - left(frac 1 p right)^2 = prod_textp prime 1 - frac 1 p^2$$



    This now ties into something known as the Riemann zeta function. There are two formulas typically associated with it: a summation and a product formula. We often focus on the summation formula but can derive the latter; a proof of said derivation can be found here. In any event, we focus on the prime product formula below:



    $$zeta(s) = prod_textp prime frac11-p^-s$$



    Bearing in mind this is a product, we can do a manipulation:



    $$frac1zeta(s) = prod_textp prime 1-frac 1 p^s$$



    This looks precisely like the formula for our probability of $a,b$ being coprime but with $s$ in lieu of $2$. Indeed, letting $s=2$,



    $$P(texta,b are coprime) = prod_textp prime 1 - frac1p^2 = frac1zeta(2)$$



    $zeta(2)$ is a known value which Euler calculated to be $pi^2/6$; finding this value is often referred to as the Basel problem. Accordingly,



    $$P(texta,b are coprime) = frac1pi^2/6 = frac6pi^2$$



    The idea also generalizes further. Say you have some group of $n$ integers ($n$ a positive integer). Then the probability that all $n$ are coprime is given by



    $$P(textall n numbers are coprime) = frac1zeta(n)$$






    share|cite|improve this answer









    $endgroup$



    Peter's answer gets to the heart of the matter relatively quickly, but I feel it would also be best to demonstrate where the $6/pi^2$ comes from, seemingly out of nowhere to the uninitiated.



    So, it should be obvious that $a/b$ is in simplest form if and only if $a,b$ are coprime, i.e. $gcd(a,b) = 1$. Well, what does that mean? It means that $a,b$ share no common prime number factors.



    In particular, it means $a,b$ do not share a factor of $2$. For (uniformly randomly chosen) nonzero integers $a,b$ (less than some other number $x$), there is a $1/2$ chance (in the limit $x to infty$) each will have a factor of $2$. Thus,



    $$P(texta,b do not have a mutual factor of 2) = 1 - left(frac 1 2 right)^2$$



    Similarly, it means that they do not share a factor of $3$. There's a $1/3$ chance each will have a factor of three, and thus,



    $$P(texta,b do not have a mutual factor of 3) = 1 - left(frac 1 3 right)^2$$



    This clearly generalizes. Consider a prime number $p$. There is a $1/p$ chance that $a,b$ each will have it, and in turn



    $$P(texta,b do not have a mutual factor of p) = 1 - left(frac 1 p right)^2$$



    For $a,b$ to be coprime this needs to be true of all primes $p$. The events are independent, and we accordingly can multiply the respective probabilities for each prime $p$, obtaining



    $$P(texta,b are coprime) = prod_textp prime 1 - left(frac 1 p right)^2 = prod_textp prime 1 - frac 1 p^2$$



    This now ties into something known as the Riemann zeta function. There are two formulas typically associated with it: a summation and a product formula. We often focus on the summation formula but can derive the latter; a proof of said derivation can be found here. In any event, we focus on the prime product formula below:



    $$zeta(s) = prod_textp prime frac11-p^-s$$



    Bearing in mind this is a product, we can do a manipulation:



    $$frac1zeta(s) = prod_textp prime 1-frac 1 p^s$$



    This looks precisely like the formula for our probability of $a,b$ being coprime but with $s$ in lieu of $2$. Indeed, letting $s=2$,



    $$P(texta,b are coprime) = prod_textp prime 1 - frac1p^2 = frac1zeta(2)$$



    $zeta(2)$ is a known value which Euler calculated to be $pi^2/6$; finding this value is often referred to as the Basel problem. Accordingly,



    $$P(texta,b are coprime) = frac1pi^2/6 = frac6pi^2$$



    The idea also generalizes further. Say you have some group of $n$ integers ($n$ a positive integer). Then the probability that all $n$ are coprime is given by



    $$P(textall n numbers are coprime) = frac1zeta(n)$$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered May 27 at 20:46









    Eevee TrainerEevee Trainer

    13k32046




    13k32046







    • 2




      $begingroup$
      This same heuristic can be applied to finding the probability that an integer is "$k$-free" (that is, an integer having no perfect $k$th power factor > 1), which also happens to be $frac1zetaleft(kright).$ In fact, the probability that greatest common divisor of $n$ integers has no perfect $k$th power factor > 1 (that is, the probability of $n$ integers being relatively $k$-prime) is $frac1zetaleft(nkright).$
      $endgroup$
      – Brian
      May 27 at 21:14












    • 2




      $begingroup$
      This same heuristic can be applied to finding the probability that an integer is "$k$-free" (that is, an integer having no perfect $k$th power factor > 1), which also happens to be $frac1zetaleft(kright).$ In fact, the probability that greatest common divisor of $n$ integers has no perfect $k$th power factor > 1 (that is, the probability of $n$ integers being relatively $k$-prime) is $frac1zetaleft(nkright).$
      $endgroup$
      – Brian
      May 27 at 21:14







    2




    2




    $begingroup$
    This same heuristic can be applied to finding the probability that an integer is "$k$-free" (that is, an integer having no perfect $k$th power factor > 1), which also happens to be $frac1zetaleft(kright).$ In fact, the probability that greatest common divisor of $n$ integers has no perfect $k$th power factor > 1 (that is, the probability of $n$ integers being relatively $k$-prime) is $frac1zetaleft(nkright).$
    $endgroup$
    – Brian
    May 27 at 21:14




    $begingroup$
    This same heuristic can be applied to finding the probability that an integer is "$k$-free" (that is, an integer having no perfect $k$th power factor > 1), which also happens to be $frac1zetaleft(kright).$ In fact, the probability that greatest common divisor of $n$ integers has no perfect $k$th power factor > 1 (that is, the probability of $n$ integers being relatively $k$-prime) is $frac1zetaleft(nkright).$
    $endgroup$
    – Brian
    May 27 at 21:14











    6












    $begingroup$

    This question is equivalent to ask for the probability that $a$ and $b$ are coprime. If $a$ and $b$ are random integers below $x$, then the probability $P(x)$ that $a$ and $b$ are coprime , satisfies $$lim_xrightarrowinfty P(x)=frac6pi^2approx0.6079$$






    share|cite|improve this answer









    $endgroup$

















      6












      $begingroup$

      This question is equivalent to ask for the probability that $a$ and $b$ are coprime. If $a$ and $b$ are random integers below $x$, then the probability $P(x)$ that $a$ and $b$ are coprime , satisfies $$lim_xrightarrowinfty P(x)=frac6pi^2approx0.6079$$






      share|cite|improve this answer









      $endgroup$















        6












        6








        6





        $begingroup$

        This question is equivalent to ask for the probability that $a$ and $b$ are coprime. If $a$ and $b$ are random integers below $x$, then the probability $P(x)$ that $a$ and $b$ are coprime , satisfies $$lim_xrightarrowinfty P(x)=frac6pi^2approx0.6079$$






        share|cite|improve this answer









        $endgroup$



        This question is equivalent to ask for the probability that $a$ and $b$ are coprime. If $a$ and $b$ are random integers below $x$, then the probability $P(x)$ that $a$ and $b$ are coprime , satisfies $$lim_xrightarrowinfty P(x)=frac6pi^2approx0.6079$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered May 27 at 20:24









        PeterPeter

        50.6k1240141




        50.6k1240141













            Popular posts from this blog

            Wikipedia:Vital articles Мазмуну Biography - Өмүр баян Philosophy and psychology - Философия жана психология Religion - Дин Social sciences - Коомдук илимдер Language and literature - Тил жана адабият Science - Илим Technology - Технология Arts and recreation - Искусство жана эс алуу History and geography - Тарых жана география Навигация менюсу

            Bruxelas-Capital Índice Historia | Composición | Situación lingüística | Clima | Cidades irmandadas | Notas | Véxase tamén | Menú de navegacióneO uso das linguas en Bruxelas e a situación do neerlandés"Rexión de Bruxelas Capital"o orixinalSitio da rexiónPáxina de Bruselas no sitio da Oficina de Promoción Turística de Valonia e BruxelasMapa Interactivo da Rexión de Bruxelas-CapitaleeWorldCat332144929079854441105155190212ID28008674080552-90000 0001 0666 3698n94104302ID540940339365017018237

            What should I write in an apology letter, since I have decided not to join a company after accepting an offer letterShould I keep looking after accepting a job offer?What should I do when I've been verbally told I would get an offer letter, but still haven't gotten one after 4 weeks?Do I accept an offer from a company that I am not likely to join?New job hasn't confirmed starting date and I want to give current employer as much notice as possibleHow should I address my manager in my resignation letter?HR delayed background verification, now jobless as resignedNo email communication after accepting a formal written offer. How should I phrase the call?What should I do if after receiving a verbal offer letter I am informed that my written job offer is put on hold due to some internal issues?Should I inform the current employer that I am about to resign within 1-2 weeks since I have signed the offer letter and waiting for visa?What company will do, if I send their offer letter to another company