Entangled quantum states are an important component of quantum computing te
chniques such as quantum error-correction, dense coding and quantum telepor
tation. We determine the requirements for a state in the Hilbert space C-4
to be entangled and a solution to the corresponding "factorization" problem
if this is not the case. The factorization of nonentangled states is imple
mented in C++.