[see also: guarantee]
Theorem 3 is remarkable in that considerably fewer conditions than in the previous theorems ensure universality.
The hypothesis $n>1$ ensures that Lemma 2 is applicable.
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