Let x, y, z and n denote positive integers with x < y < z and (x, y, z) = 1. The purpose of this note is to prove two theorems, the first of which is
THEOREM 1. for some positive number Co, and if
then n is less than C, a number which is effectively computable in terms of Co.