“…{p=3;print("p=",p);n=8+floor(30/p);g=znprimroot(p);forprime(N=1,10ˆ3, if(Mod(N,p)!=1,next);P=xˆp-N;print();print("P=",P);T=Mod(0,p); for(k=1,(N-1)/2,if(Mod(k,p)==0,next);T=T+k * znlog(k,g));K=bnfinit(P,1); F=idealfactor(K,p);d=matsize(F) [1];F1=component(F,1); for(j=1,d,print(F1[j]));for(z=2ˆd,2 * 2ˆd-1,bin=binary(z);mod=List; for(j=1,d,listput(mod,bin[j+1],j));M=1;for(j=1,d,ch=mod[j]; if(ch==1,F1j=F1[j];ej=F1j [3];F1j=idealpow(K,F1j,ej); M=idealmul(K,M,F1j)));Idn=idealpow(K,M,n);Kpn=bnrinit(K,Idn); Hpn=Kpn.cyc;L=List;e=matsize(Hpn) [2];R=0; for(k=1,e,c=Hpn[e-k+1];w=valuation(c,p);if(w>0,R=R+1; listinsert(L,pˆw,1)));print("S=",mod," rk(A_S)=",R," A_S=",L)))} p=3 [11, [-5, 0, 0, 0, 0, 0, 0, 0, 0, 0, -5]˜, 1, 1, [10,9,8,7,6, 5, 4, 6, 3, 2, 1]˜] [11, [-5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5]˜, 10, 1, [10,9,8,7,6,5,4 [13, [-4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4]˜, 12, 1, [12,11,10,9,8,7,6, 5, 5, 4, 3, 2, 1]˜] [13, [5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -4]˜, 1, 1, [12,11,10,9,8,7,6, 5, 2, 4, 3, 2, 1]˜] T=Mod(0,13) S=[0,0] rk(A_S)=1 A_S= [13] T=Mod(0,13) S=[0,1] rk(A_S)=1 A_S= [13] T=Mod(0,13) S= [1,0]…”