[see also: requirement, stipulation]
The demand that each entry be a perfect square results in nine equations. [Note the subjunctive be.]
[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.
Go to the list of words starting with: a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
y
z