FLINT3.7.0-dev

_aprcl_is_gausspower_2q_equal_first, _aprcl_is_gausspower_2q_equal_second, _aprcl_is_gausspower_from_unity_p

Synopsis#include <flint/aprcl.h>
int _aprcl_is_gausspower_2q_equal_first(ulong q, const fmpz_t n)source
int _aprcl_is_gausspower_2q_equal_second(ulong q, const fmpz_t n)source
slong _aprcl_is_gausspower_from_unity_p(ulong q, ulong r, const fmpz_t n)source

Checks of the Gauss sum test, for the Gauss sum \tau(\chi) of a character \chi of conductor q: whether (\chi(-1) q)^{(n-1)/2} \equiv -1 \pmod n and whether q^{(n-1)/2} \equiv -1 \pmod n (for the quadratic character, returning 1 or 0), and for a character of order r, returns i such that \tau(\chi^n) = \zeta_r^i \tau(\chi)^n, or -1 if there is none.

Cite this page

The FLINT team, “_aprcl_is_gausspower_2q_equal_first, _aprcl_is_gausspower_2q_equal_second, _aprcl_is_gausspower_from_unity_p (aprcl.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/aprcl/_aprcl_is_gausspower_2q_equal_first.html (generated 2026-10-20).