?? 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 + -