This paper examines percolation questions in a deterministic setting. In pa
rticular, I consider R, the set of elements of Z(2) with greatest common di
visor equal to 1, where two Sites are connected if they are at distance 1.
The main result of the paper proves that the infinite component has an asym
ptotic density. An "almost everywhere" sieve of J. Friedlander is used to o
btain the result.