On an n × n square grid, two vertices are chosen at random and a segment is drawn connecting them. As n → ∞ , what is the probability that the segment does not cross any vertices of this graph besides the two chosen ones?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There is no probability that two numbers are coprime, just as there is no probability that a randomly chosen number is even. There are countably many even integers, exactly the same as the number of all integers, and there is no meaning to trying to divide infinity by itself.
Looked at another way, your argument implies that all integers are equally likely to be chosen, and hence that there is a uniform distribution on the set of integers. This cannot exist: if each integer had the same probability p of occurring, the sum of an infinite number of copies of p would have to be equal to 1 , which is not possible.
What you can say is that the limit as N tends to infinity of the probability that a number randomly and uniformly chosen from − N to N is even is 2 1 . Similarly, and this is what the question seeks, you can say that the limit as x tends to infinity of the probability that two numbers chosen independently and uniformly from − x to x are coprime is π 2 6 . This last number is not, however, a probability.
Log in to reply
Well, it is the limit of a probability, though
Log in to reply
Yes, of course. That is what the question asked for. The fact that the answer is not itself a probability does make it a little difficult to write down the infinite product as justified here.
I don't get it. If n -> ∞, then one of the vertices can always be used as the origin (0, 0) & we have a line Y = (b/a)X, where b/a is the slope (w/ both a & b being integers). So the question becomes: for equation aY = bX, are there integer solutions of X & Y (besides X = a; Y = b)? The answer: there are infinitely many such solutions. So the prob that the line doesn't cross any vertices is ZERO.
Log in to reply
You need to look for finite line segments that have no integer coordinates except at their endpoints. You are thinking of infinite lines...
Log in to reply
Oops. Yeah, it's about segments, not lines. Thank!
Well, no. In at least one case, where the terminus is in the adjacent line, the connecting line cannot cross any vertices since there are none between two adjacent lines. Hence the probability that the line doesn’t cross any vertices must be nonzero since there is at least one case. Similarly, where the terminus is at the furthest from the origin (x or y = n) the connecting line will intersect every vertices and there is at least one case where the probability is 1. Since every other terminus will be less than n, their probability must be less than one and the probability of an intersection between randomly selected points is less than 1. A good, if rough approximation of the probability of intersecting a vertices between any two randomly selected points is sine (45) or 1/sqrt(2) or about 0.7.
Relevant wiki: Euler's Totient Function
Since m ≤ x ∑ ϕ ( m ) = m ≤ x ∑ d ∣ m ∑ μ ( d ) d m = d ≤ x ∑ μ ( d ) m ≤ d x ∑ m = d ≤ x ∑ μ ( d ) ( 2 d 2 x 2 + O ( d x ) ) = 2 1 x 2 d ≤ x ∑ d 2 μ ( d ) + O ( x ln x ) = 2 1 x 2 d = 1 ∑ ∞ d 2 μ ( d ) − 2 1 x 2 d > x ∑ d 2 μ ( d ) + O ( x ln x ) = 2 ζ ( 2 ) x 2 + O ( x ln x ) as x → ∞ , the probability that two randomly chosen integers in 1 , 2 , 3 , . . . , x are coprime is x 2 2 m ≤ x ∑ ϕ ( x ) = ζ ( 2 ) 1 + O ( x ln x ) x → ∞ Since nonzero a , b in − x , − x + 1 , . . . , x − 1 , x are coprime if and only if ∣ a ∣ , ∣ b ∣ in 1 , 2 , . . . , x are coprime, and a , b are never coprime if either a or b is zero, this is also (at least asymptotically as x → ∞ ) the probability that two randomly chosen integers in − x , − x + 1 , . . . , x − 1 , x are coprime. Thus the desired limit is ζ ( 2 ) − 1 = π 2 6 .
We need to find 2 integers which are relatively prime.
Relevant wiki: Euler's Totient Function
I didn't know anything about how to solve Euler function's sum, so I just
and divided by 2 1 0 0 0 0 0 2
:D
wolframalpha is great!
I finally realised that I needed lim (sum phi ( j) / j divided by n) but didn't know how to proceed, so I used hand calculator for n=20 and got .6236, for which Brilliant generously gave me credit. Jason and Mark's answers are much better. Great problem!
What would be the formula for n instead of n approaching infinity?
Log in to reply
I dunno, I only thought about n approaching infinity, so...
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Basel Problem
For the segment not to cross any other vertices it means that the difference in x and y coordinates of the two vertices are coprime. Therefore, we are looking for the probability that two natural numbers chosen at random are coprime, i.e. they don't have prime factors in common. By notting that 1 in 2 numbers has 2 as a factor, 1 in 3 numbers has 3 as a factor, 1 in 5 numbers has 5 as a factor, etc... we can write the probability as
P { a , b coprime } = ( 1 − 2 2 1 ) ( 1 − 3 2 1 ) ( 1 − 5 2 1 ) ⋅ … = p prime ∏ ( 1 − p 2 1 )
But the right hand size is just ζ ( 2 ) 1 = π 2 6 ≈ 0 . 6 0 7 9 2 by the Euler product formula for the Riemann zeta function.