Probability of fraction not being able to be simplifiedProbability density function of: Z = X sin Y.What does...
Were pen cap holes designed to prevent death by suffocation if swallowed?
What is a subpixel in Super Mario Bros, and how does it relate to wall clipping?
Split polygon using another polygon in QGIS
Can a wire having a 610-670 THz (frequency of blue light) AC frequency supply, generate blue light?
Is floating in space similar to falling under gravity?
What F1 in name of seeds/varieties means?
What are the benefits of cryosleep?
What is the 中 in ダウンロード中?
How were these pictures of spacecraft wind tunnel testing taken?
Is there an evolutionary advantage to having two heads?
Where did the “Vikings wear helmets with horn” stereotype come from and why?
How could Catholicism have incorporated witchcraft into its dogma?
Different PCB color ( is it different material? )
Modern approach to radio buttons
What are the problems in teaching guitar via Skype?
shutdown at specific date
Do you play the upbeat when beginning to play a series of notes, and then after?
Why doesn't the Earth's acceleration towards the Moon accumulate to push the Earth off its orbit?
Is CD audio quality good enough for the final delivery of music?
Is this story about US tax office reasonable?
Smart people send dumb people to a new planet on a space craft that crashes into a body of water
Leading and Suffering Numbers
Glitch in AC sine wave interfering with phase cut dimming
Preserving culinary oils
Probability of fraction not being able to be simplified
Probability density function of: Z = X sin Y.What does a probability being i.i.d means?What is the probability $P{X_1 rm{~is ~largest}}$?X/Y probability being within a rangeProbability of being at least slightly above the meanFinding the probability of a fraction being in lowest terms.estimate a probabilityMust a random vector following a multivariate uniform distribution be independent uniform random variables?How to determine the probability of this inequality being true?probability of a quadratic function has real roots
$begingroup$
Let a and b be random independent positive integers that follow the uniform distribution. What is the probability that the fraction:
$frac{a}{b}$
cannot be simplified?
probability number-theory
$endgroup$
add a comment |
$begingroup$
Let a and b be random independent positive integers that follow the uniform distribution. What is the probability that the fraction:
$frac{a}{b}$
cannot be simplified?
probability number-theory
$endgroup$
$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
8 hours ago
8
$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
8 hours ago
add a comment |
$begingroup$
Let a and b be random independent positive integers that follow the uniform distribution. What is the probability that the fraction:
$frac{a}{b}$
cannot be simplified?
probability number-theory
$endgroup$
Let a and b be random independent positive integers that follow the uniform distribution. What is the probability that the fraction:
$frac{a}{b}$
cannot be simplified?
probability number-theory
probability number-theory
asked 8 hours ago
michail vazaiosmichail vazaios
456
456
$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
8 hours ago
8
$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
8 hours ago
add a comment |
$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
8 hours ago
8
$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
8 hours ago
$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
8 hours ago
$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
8 hours ago
8
8
$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
8 hours ago
$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
8 hours ago
add a comment |
2 Answers
2
active
oldest
votes
$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(text{a,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(text{a,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(text{a,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(text{a,b are coprime}) = prod_{text{p prime}} 1 - left(frac 1 p right)^2 = prod_{text{p 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_{text{p prime}} frac{1}{1-p^{-s}}$$
Bearing in mind this is a product, we can do a manipulation:
$$frac{1}{zeta(s)} = prod_{text{p 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(text{a,b are coprime}) = prod_{text{p prime}} 1 - frac{1}{p^2} = frac{1}{zeta(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(text{a,b are coprime}) = frac{1}{pi^2/6} = frac{6}{pi^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(text{all n numbers are coprime}) = frac{1}{zeta(n)}$$
$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 $frac{1}{zetaleft(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 $frac{1}{zetaleft(nkright)}.$
$endgroup$
– Brian
7 hours ago
add a comment |
$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)=frac{6}{pi^2}approx0.6079$$
$endgroup$
add a comment |
Your Answer
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3241967%2fprobability-of-fraction-not-being-able-to-be-simplified%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
$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(text{a,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(text{a,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(text{a,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(text{a,b are coprime}) = prod_{text{p prime}} 1 - left(frac 1 p right)^2 = prod_{text{p 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_{text{p prime}} frac{1}{1-p^{-s}}$$
Bearing in mind this is a product, we can do a manipulation:
$$frac{1}{zeta(s)} = prod_{text{p 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(text{a,b are coprime}) = prod_{text{p prime}} 1 - frac{1}{p^2} = frac{1}{zeta(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(text{a,b are coprime}) = frac{1}{pi^2/6} = frac{6}{pi^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(text{all n numbers are coprime}) = frac{1}{zeta(n)}$$
$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 $frac{1}{zetaleft(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 $frac{1}{zetaleft(nkright)}.$
$endgroup$
– Brian
7 hours ago
add a comment |
$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(text{a,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(text{a,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(text{a,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(text{a,b are coprime}) = prod_{text{p prime}} 1 - left(frac 1 p right)^2 = prod_{text{p 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_{text{p prime}} frac{1}{1-p^{-s}}$$
Bearing in mind this is a product, we can do a manipulation:
$$frac{1}{zeta(s)} = prod_{text{p 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(text{a,b are coprime}) = prod_{text{p prime}} 1 - frac{1}{p^2} = frac{1}{zeta(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(text{a,b are coprime}) = frac{1}{pi^2/6} = frac{6}{pi^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(text{all n numbers are coprime}) = frac{1}{zeta(n)}$$
$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 $frac{1}{zetaleft(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 $frac{1}{zetaleft(nkright)}.$
$endgroup$
– Brian
7 hours ago
add a comment |
$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(text{a,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(text{a,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(text{a,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(text{a,b are coprime}) = prod_{text{p prime}} 1 - left(frac 1 p right)^2 = prod_{text{p 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_{text{p prime}} frac{1}{1-p^{-s}}$$
Bearing in mind this is a product, we can do a manipulation:
$$frac{1}{zeta(s)} = prod_{text{p 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(text{a,b are coprime}) = prod_{text{p prime}} 1 - frac{1}{p^2} = frac{1}{zeta(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(text{a,b are coprime}) = frac{1}{pi^2/6} = frac{6}{pi^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(text{all n numbers are coprime}) = frac{1}{zeta(n)}$$
$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(text{a,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(text{a,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(text{a,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(text{a,b are coprime}) = prod_{text{p prime}} 1 - left(frac 1 p right)^2 = prod_{text{p 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_{text{p prime}} frac{1}{1-p^{-s}}$$
Bearing in mind this is a product, we can do a manipulation:
$$frac{1}{zeta(s)} = prod_{text{p 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(text{a,b are coprime}) = prod_{text{p prime}} 1 - frac{1}{p^2} = frac{1}{zeta(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(text{a,b are coprime}) = frac{1}{pi^2/6} = frac{6}{pi^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(text{all n numbers are coprime}) = frac{1}{zeta(n)}$$
answered 8 hours ago
Eevee TrainerEevee Trainer
12.7k32045
12.7k32045
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 $frac{1}{zetaleft(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 $frac{1}{zetaleft(nkright)}.$
$endgroup$
– Brian
7 hours ago
add a comment |
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 $frac{1}{zetaleft(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 $frac{1}{zetaleft(nkright)}.$
$endgroup$
– Brian
7 hours ago
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 $frac{1}{zetaleft(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 $frac{1}{zetaleft(nkright)}.$
$endgroup$
– Brian
7 hours ago
$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 $frac{1}{zetaleft(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 $frac{1}{zetaleft(nkright)}.$
$endgroup$
– Brian
7 hours ago
add a comment |
$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)=frac{6}{pi^2}approx0.6079$$
$endgroup$
add a comment |
$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)=frac{6}{pi^2}approx0.6079$$
$endgroup$
add a comment |
$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)=frac{6}{pi^2}approx0.6079$$
$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)=frac{6}{pi^2}approx0.6079$$
answered 8 hours ago
PeterPeter
50.4k1240141
50.4k1240141
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3241967%2fprobability-of-fraction-not-being-able-to-be-simplified%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$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
8 hours ago
8
$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
8 hours ago