Let n and k be arbitrary positive integers. We well tend to be concerned with small k and with n which are several times k!. I stated two conditions on (n,k) in a previous paper; in this paper I restate them and further explore them. In particular, it is proven that if n is the least number satisfying Condition 1 for a certain k, then the least number for k + 1 must be at least 2n + 1. Condition 1 and Condition 2 are rephrased graph-theoretically. A heuristic explanation for why the quadratic residues tend to satisfy Condition 2b is given. A conjecture characterizes n and k which satisfy Condition 2b when n is a prime of the form 4m + 1 and Q are the quadratic residues. The case of the quadratic residues Or non-residues with zero appended to them is discussed.
展开▼
