>>394
論文では、以下のように、n=17の具体例だけ示して、いきなりThe minimum n when there exists r with a(n, r) > b(n, r) is 7 and the minimum
r where a(n, r) > b(n, r) holds is 5.と書いているだけ。これを、一般の場合の証明と混同されていると、いうわけよ

When n = 17 holds, the relations are selected
as follows.
When r = 13, [299,13]
When r = 11, [297,11]
When r = 7, [294,7],[301,14]
When r = 5, [290,5],[295,10],[305,15]
When r = 3, [291,3],[300,6],[303,9]
5
When r = 2, [292,2],[296,4],[298,8],[302,12],[304,16]
The minimum n when there exists r with a(n, r) > b(n, r) is 7 and the minimum
r where a(n, r) > b(n, r) holds is 5. Therefore, if we select the relations this way,
one-to-one correspondence with all composite numbers p can be set for r for all n
where n ≧ 3 holds.