Alec,
Perfect, that's just what I needed. Much better.
Since the NumberField constructor should complain if the next
polynomial (the quotient of the division) is not irreducible, the
students can just proceed on faith that the result of the division is
the remaining portion of a factorization an
On Apr 14, 2:08 pm, Rob Beezer wrote:
> Rinse, repeat. First iteration is below. By the time I get to degree
> 3 the factorizations are taking about 8 hours. My question: is there
> a more efficient way to do this?
Divisions are faster than the factorization - divide by (x-a), then by
(x-b),
