我是 PARI/GP 的新手,正在了解不同的数字字段。我正在尝试使用 bnfinit
(第 23 个分圆字段)构造字段 k = Q(\zeta_23)
来运行以下脚本:
v=[]; w=[]; j=0; l=0;
forprime(p=29, 100000, {
if(p%46==1, j++; if(#bnfisintnorm(k,p)>0,l++;w=[p];v=concat(v,w)))
});
print("Up to 100000 there are ",j," primes congruent to 1 mod 46 and ",l," are norms of principal ideals")
遇到 GP 会出现此错误,
<=1,j++;if(#bnfisintnorm(k,p)>0,l++;w=[p];v=concat(v,w))));print("Up to 100000 there are ",j," primes congruent to 1 mod 46 and ",l," are norms of principal ideals")
*** at top-level: ...00000,if(p%46==1,j++;if(#bnfisintnorm(k,p)>0,
*** ^--------------------
*** bnfisintnorm: incorrect type in checknf [please apply nfinit()] (t_POL).
(18:29) gp >
这应该找到素数 p,使得域 K 中存在范数为 p 的代数整数。
请问有什么帮助吗?谢谢。
最佳答案
您可以定义所需的数字字段,就像k = bnfinit(polcyclo(23))
。所以你的代码将输出:
gp> Up to 100000 there are 429 primes congruent to 1 mod 46 and 141 are norms of principal ideals
希望有帮助。
关于algorithm - 如何在 bnfinit() 中构造字段?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/46270410/