algorithm - 如何在 bnfinit() 中构造字段？

Question

我是 PARI/GP 的新手，正在学习不同的数字字段。我正在尝试k = Q(\zeta_23)使用bnfinit(23rd cyclotomic field) 构建该字段来运行以下脚本：

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。

请问有什么帮助吗？谢谢。

Answer 1

您可以将所需的数字字段定义为k = bnfinit(polcyclo(23))。所以你的代码将输出：

gp> Up to 100000 there are 429 primes congruent to 1 mod 46 and 141 are norms of principal ideals

希望能帮助到你。