You can roughly approximate a square root in a script using Heron's method, but you're only going to get coarse integer results.
# The value to square root
%NUM := 33
# Begin with an estimate
%SQRT := %NUM / 100 + 1
# Iterate over the algorithm
%SQRT := (%SQRT + %NUM / %SQRT) / 2
%SQRT := (%SQRT + %NUM / %SQRT) / 2
%SQRT := (%SQRT + %NUM / %SQRT) / 2
%SQRT := (%SQRT + %NUM / %SQRT) / 2
%SQRT := (%SQRT + %NUM / %SQRT) / 2
With a of , will yield , which is an underestimate but in line with the way scripts truncate the fractional part of numbers. With the estimate formula and five iterations of the algorithm, there should be no error for any root that's a whole number up to , but you could add more iterations to lessen the error at higher ranges.
Of course, if you know you're only going to be taking the square root of a small range of numbers, it might be simpler to just do a couple IF statements.
IF %NUM >= 36 THEN %SQRT := 6
ELSE IF %NUM >= 25 THEN %SQRT := 5
ELSE IF %NUM >= 16 THEN %SQRT := 4
ELSE IF %NUM >= 9 THEN %SQRT := 3
ELSE IF %NUM >= 4 THEN %SQRT := 2
ELSE %SQRT := 1