Suppose you have a $n \times 1$ column vector
$$a=\begin{bmatrix}a_1\\{a_2}\\ \vdots\\{a_n}\end{bmatrix}$$
and a $1 \times m$ row vector
$$\quad b=\begin{bmatrix}b_1 & b_2 & \ldots & b_m\end{bmatrix}$$
If you then multiply these
$$A=ab=\begin{bmatrix} a_{1}b_1 & a_{1}b_2 & \ldots & a_{1}b_m\\ a_{2}b_1 & a_{2}b_2 & \ldots & a_{2}b_m \\ \vdots&&&\vdots \\ a_{n}b_1 & a_{n}b_2 & \ldots & a_{n}b_m\end{bmatrix}$$
How difficult (if possible) is it to find the original vectors $a$ and $b$ if you are given $A$?
You cannot determine the original vectors $a$ and $b$, since they are not unique ($2a$ and $0.5b$ yield the same result as Rodrigo explains). However, you can construct one $a$ and $b$ such that $A=ab^T$. Just find any nonzero element in $A$. Let's assume that the (1,1) element is nonzero, but the method works in other cases too. The (1,1) element is $a_1 b_1$. Now let $a_1=1$, then you can compute $b_1$. By going through the first row and first column, you can compute all elements of the vectors $a$ and $b$.