assert(MP_POSP(n));
/* Pick a starting point. This is rather important to get right. In
- * particular, for large %$n$%, if we our initial guess too small, then the
+ * particular, for large %$n$%, if our initial guess is too small, then the
* next iteration is a wild overestimate and it takes a long time to
* converge back.
*/
t = mp_nthrt(t, a, p, &exactp);
if (MP_EQ(t, MP_ONE))
break;
- else if (!exactp) {
- if (MP_EQ(t, MP_ONE)) break;
+ else if (!exactp)
p = primeiter_next(&pi, p);
- } else {
+ else {
r = mp_mul(r, r, p);
MP_DROP(a); a = t; t = MP_NEW;
rc = 1;