1
[see also: requirement] The demand that each entry be a perfect square results in
nine equations. [Note the subjunctive be.]
2
[see also: require] Part 2 of the proof demands only that k>1.
A computational restraint is the algebraic number theory involved in finding these ranks, which will typically be more demanding than in our example of Section 1.