Use Pollard$$s p $1$ algorithm to try to factor n $=1425737.$ Here is C$-$like pseudocode for this that does not require computations with numbers greater than n $2.$ n $=1425737$; a $=2$; B $=20$; b$[1]=$ a; for $($k$=2$;k$$ B;k$++)\{$ for $($j$=1$:j$$ k;j$++)/$ loop is necessary to prevent overflow $/$ b$[$k$]=$ b$[$k$]$b$[$k$-1]$ mod n ; d$[$k$]=$ gcd$($b$[$k$]-1,$n$)$; if $($d$[$k$]>1$ && d$[$k$]<$ n$)\{$ print$("$factored at k $=\%$d: p $=\%$d$",$k$,$d$[$k$])$; break; $\}\}$ Why did this algorithm terminate when it did?