`fmpz_divides_mod_list`

Synopsis#include <flint/fmpz.h>

void fmpz_divides_mod_list(fmpz_t xstart, fmpz_t xstride, fmpz_t xlength, const fmpz_t a, const fmpz_t b, const fmpz_t n)

source

Sets the outputs so that the solutions $x \in [0, n)$ of $ax \equiv b \pmod n$ are exactly $\mathit{xstart} + i \cdot \mathit{xstride}$ for $0 \le i < \mathit{xlength}$ ; there are none if xlength is 0. Requires $n > 0$ ; the outputs must be distinct objects.

Cite this page

The FLINT team, “fmpz_divides_mod_list (fmpz.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz/fmpz_divides_mod_list.html (generated 2026-11-02).

@misc{flint-doc-fmpz-fmpz-divides-mod-list,
  author       = {{The FLINT team}},
  title        = {{fmpz\_divides\_mod\_list (fmpz.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/fmpz/fmpz_divides_mod_list.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95