jacobi.h

来自「包含哈希,对称以及非对称的经典算法 包含经典事例」· C头文件 代码 · 共 8 行

/*
 * For a small (usually prime, but not necessarily) prime p,
 * Return Jacobi(p,bn), which is -1, 0 or +1.
 * bn must be odd.
 */
struct BigNum;
int bnJacobiQ(unsigned p, struct BigNum const *bn);