POLYNOMIAL RING AND DIVISION ALGORITHM FOR POLYNOMIALS OVER A FIELD
Abstract
This project work considered polynomial ring and division algorithm for polynomials over a field. However, for the purpose of this work, polynomials as well as division algorithm for polynomials of arbitrary field have been discussed vividly. Moreover, least common multiple (LCM), highest common factor (HCF), reducibility and irreducibility of polynomials over a given field were described and realized. Finally, Lagrange’s interpolation method was used as an essential tool for constructing polynomials over a given field.
Full-Text Access Notice
In accordance with the NERD Policy on promoting peer-reviewed publication, public access to the full text of a project, thesis or dissertation is restricted for three years, allowing the author and supervisors sufficient time to pursue peer-reviewed publication.
During this period, researchers with legitimate academic or research purposes may request authorisation directly from the author to enable NERD to release the indexed full texts of the work using the form below.