Abstract
We present an algorithm to determine all roots of a prime degree p polynomial with dihedral Galois group D 2p as rational functions of any two of them. This must be seen as an effective version of a more general result of Galois valid for prime degree equations with solvable group.
| Original language | English |
|---|---|
| Pages (from-to) | 295-300 |
| Number of pages | 6 |
| Journal | Indian Journal of Pure and Applied Mathematics |
| Volume | 36 |
| Issue number | 6 |
| Publication status | Published - Jun 2005 |
Keywords
- Computational Number Theory
- Galois Theory
Fingerprint
Dive into the research topics of 'A note on dihedral polynomials of prime degree'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver