Assume in any step of a division, there is not a div0 error.
1 + 1 = 2
n(1+1) = 2n, for any n subset R except 0.
a+n(1+1) = 2n, for any a subset R
(a+n(1+1))/n = 2
int((a+n(1+1))/n), da) = int(2, da)
(((a^2)/2)+an(1+1))/n = 2a
At this point, it becomes unbearable to continue typing. If only I remembered the typing notation. Of course, we now need to multiply both sides by i, do some more random mathematics, and then square both sides.