[see also: resolve]
We can solve the resulting equations successively for $c_1,...,c_n$.
We remark that Bennett and the third author completely solved equation (4) in the case when ......
If $y$ is a solution, then $ay$ also solves (3) for all $a$ in $B$.
This easily allows the cases $c=1,2,4$ to be solved.
This problem is still far from being solved.
The MR algorithm takes $n$ steps to solve the problem.
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