📄 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 "alp";
Rs=[];
while u==1
alp=alp+1;
for k=1:l
Rs(k)=emn(alp,ord(k),p);
end; %finishes raising alp to potential orders modulo p;
u=min(Rs);
end; %finding the primitive root;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -