Algorithm for Finding a Biquadratic


Let p ≡ 1 (mod 4) be a prime number and let ζ = e be a primitive root of unity. Then there exists a unique biquadratic extension eld Q(y)/Q that is a sub eld of Q(ζ). The aim of this work is to construct an algorithm for nding such y explicitly. Finally we state a general conjecture about the y we found. 


2 Figures and Tables

Cite this paper

@inproceedings{Perez2008AlgorithmFF, title={Algorithm for Finding a Biquadratic}, author={Amilcar Perez}, year={2008} }