Lines Matching full:roots
1578 numbers (less than 1000 bits) I'd avoid $b > 3$ situations. Will return a positive root only for even roots and return
1579 a root with the sign of the input for odd roots. For example, performing $4^{1/2}$ will return $2$ whereas $(-8)^{1/3}$
1583 the algorithm requires raising $a$ to the power of $b$ it is not ideal to attempt to find roots for large
1584 values of $b$. If particularly large roots are required then a factor method could be used instead. For example,