代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/303435/3811243
lib dpfafft.cwp.lib
PFAFFT - Functions to perform Prime Factor (PFA) FFT's, in place
npfa_d return valid n for complex-to-complex PFA
npfar_d return valid n for real-to-complex/complex-to-real PFA
npfao_d return opti
www.eeworm.com/read/269264/4246509
cc primroot.cc
#include "mod.h"
#include "modm.h"
#include "factor.h"
//#include "jjassert.h"
int
is_primitive_root_mod(umod_t r, umod_t m, const factorization &pf)
//
// tests whether r is a primitive root
//
/
www.eeworm.com/read/430037/1942693
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al
www.eeworm.com/read/430037/1942722
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al
www.eeworm.com/read/430037/1942767
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al
www.eeworm.com/read/430037/1942801
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al