Loading [MathJax]/extensions/MathZoom.js
We describe a simple procedure to find Aurifeuillian factors of values of cyclotomic polynomials for integers and . Assuming a suitable Riemann Hypothesis, the algorithm runs in deterministic time , using space, where .
Let be a number field defined by an irreducible polynomial and its ring of integers. For every prime integer , we give sufficient and necessary conditions on that guarantee the existence of exactly prime ideals of lying above , where factors into powers of monic irreducible polynomials in . The given result presents a weaker condition than that given by S. K. Khanduja and M. Kumar (2010), which guarantees the existence of exactly prime ideals of lying above . We further specify...
Currently displaying 1 –
4 of
4