例えば
3,4ページもこれもスキップのルールだけで、pの個数がrの個数を上回る場合の例にはなっていない


Define [p, r] as a relation from p to r. We will select the relations between p and r
so that there are all one-to-one correspondences. At first the relations are selected
by r which are multiples of 2 for each p. [82,2] is sorted out when p = 82 holds.
Then [84,4] is sorted out since r = 2 has been selected. When p = 86 holds, there
is one combination (q, r) = (43,2) and r = 2 has been taken from. In this case, we
consider to use the factor 2 of 6 and think that there is a relation [86,6]. Then
[88,8] is sorted out. Next, we select the relation by 3 multiples r and [87,3] is
sorted out.
When r is a composite number, we skip the number since we have already taken
from the relations by a multiple of the prime factor of r. Next, we select the
relations by multiples of prime numbers greater than or equal to 5.
Let a(n, r) and b(n, r) be integers and a(n, r) be the number of r multiples in the
range of the inequalities (2) and b(n, r) be that in the range of the inequalities (4).
The following inequalities hold.
a(n, r) ≦ b(n, r) + 1