watch
Babylonian method, but modified! a(0)>0 a(n)=numerator of a(n-1) squared+(2* (denominator of a(n-1) squared))/2* denominator of a(n-1)* numerator of a(n-1), with a(n) getting closer to the square root of 2.
