If we pick any two positive integers at random, what is the probability that their greatest common factor is 2? I have been wondering about this problem for a while and done some work on it. I started by thinking of a reasonable upper or lower bound. My upper bound was simply $.25$ as that is the probability of picking two even numbers (i.e. having a factor of 2) but if I was to pick (8,12) their gcf is 4. Then I thought about subtracting off the probability that the two numbers chosen had a common factor of 4 and then doing that for 6, 8, 10 and so on which got me to the sum of $1/4 -1/16 - 1/36 - 1/64 -...$ $= 1/2 - \frac{\pi^2}{24}$ I did some experimentation on smaller cases and I do not think my work was right, it should be closer to about $.158$ Also I think my method removed too much like when I subtracted off numbers that had 4 as a factor and numbers that had 6 as a factor I subtracted 12 twice. What should I do to adjust my work or get back on track? I was considering inclusion-exclusion but that seems too complicated for this problem. Thank you for any help
2026-02-23 04:56:29.1771822589
What is the probability that 2 integers have a greatest common factor of 2?
764 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in COPRIME
- Squares of two coprime numbers
- Kernel and image of coprime factors of the minimal polynomial
- Is there an elegant Stern Brocot like way to generate all coprime triples?
- Show that 5n + 3 and 7n + 4 are relatively prime for any n 2 N. Show that s and t are not unique.
- Definition of Coprime
- $C_m \times C_n$ isomorphic to $C_{mn}$
- Prove co-prime exist
- Does $\exists b \in F_n(b^p=a)$ and $\exists c \in F_n(c^q=a)$ imply $\exists d \in F_n(d^{pq}=a)$?
- Inequality involving power to fractional part of integer multiples of logarithm of integer to coprime base.
- Problem with discrepancy of results, one of which is close to $\sqrt{\frac{\varphi^5}{5}}$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
In this question it is shown that the probability two integers are coprime is $\frac 6{\pi^2}$ in the sense that you choose the integers between $1$ and $N$ uniformly, then take the limit as $N \to \infty$. For the $\gcd$ to be $2$, you need both integers to be even, then the numbers that are half of each of them to be coprime. The chance is then $\frac 14 \cdot \frac 6{\pi^2}$