The probability of choosing primitive sets

We generalize a theorem of Nymann that the density of points in Zd that are visible from the origin is 1/ζ(d), where ζ(a) is the Riemann zeta function . A subset S⊂Zd is called primitive if it is a Z-basis for the lattice Zd∩spanR(S), or, equivalently, if S can be completed to a Z-basis of Zd. We prove that if m points in Zd are chosen uniformly and independently at random from a large box, then as the size of the box goes to infinity, the probability that the points form a primitive set approaches 1/(ζ(d)ζ(d−1)⋯ζ(d−m+1)).