`_nmod_mat_mul_u32`

Synopsis#include <flint/nmod_mat.h>

int _nmod_mat_mul_u32(uint32_t * C, slong Cstride, const uint32_t * A, slong Astride, const uint32_t * B, slong Bstride, slong m, slong k, slong n, nmod_t mod)

source

The multiplication of nmod_mat_mul_u32 on arrays of 32-bit entries: $A$ is $m \times k$ , $B$ is $k \times n$ and $C$ is $m \times n$ , each stored by rows with the given row strides, with entries reduced modulo mod.n. Returns 0 if mod.n $\ge 2^{32}$ or on 32-bit machines and 1 otherwise. $C$ may be equal to $A$ or $B$ (same pointer and stride) but must not otherwise overlap them.

Cite this page

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

@misc{flint-doc-nmod-mat-nmod-mat-mul-u32,
  author       = {{The FLINT team}},
  title        = {{\_nmod\_mat\_mul\_u32 (nmod\_mat.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/nmod_mat/_nmod_mat_mul_u32.html},
  note         = {Generated 2026-11-02}
}

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