?? primemod.m
字號:
function r = PrimeMOD(x0,n,type)
format long;
M1 = power(2,35)-31;
M2 = power(2,31)-1;
a1 = 3125;
a2 = 16807;
r = zeros(n,1);
x = zeros(n+5,1);
x(1) = x0;
if type == 1
for i=2:n+5
y = a1*x(i-1);
x(i) = mod(y, M1);
end
r = x(6:(n+5))/M1;
else
for i=2:n+5
y = a2*x(i-1);
x(i) = mod(y, M2);
end
r = x(6:(n+5))/M2;
end
format short;
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -