1 | initial version |

If your integer is really big, not a prime number, and does not have too small factors, then you should have a look at the `qsieve`

function, see or example https://doc.sagemath.org/html/en/thematic_tutorials/explicit_methods_in_number_theory/integer_factorization.html#quadratic-sieve

2 | No.2 Revision |

If your integer is really big, not a prime number, and does not have too small factors, then you should have a look at the `qsieve`

function, see or example https://doc.sagemath.org/html/en/thematic_tutorials/explicit_methods_in_number_theory/integer_factorization.html#quadratic-sieve

In particular, you can look at the `block=False`

option:

```
sage: q=qsieve(n, block=False)
sage: q
sage: q
sage: q
sage: q.quit()
```

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.