dc.contributor.author | Mahfouz, Etienne | |
dc.date.accessioned | 2022-04-12T10:02:49Z | |
dc.date.available | 2022-04-12T10:02:49Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Mahfouz, E. (2013). Unique factorization in quadratic fields (Master's thesis, Notre Dame University-Louaize, Zouk Mosbeh, Lebanon). Retrieved from http://ir.ndu.edu.lb/123456789/1508 | |
dc.identifier.uri | http://ir.ndu.edu.lb/123456789/1508 | |
dc.description | M.S. -- Faculty of Natural and Applied Sciences, Notre Dame University, Louaize, 2013; "Thesis submitted in partial fulfillment of the requirements for the degree of Masters of Science in Mathematics in the Department of Mathematics and Statistics in the Faculty of Natural and Applied Sciences, Notre Dame University"; Includes bibliographical references (leaf 44) | |
dc.description.abstract | We need the following definitions: An integral domain is a commutative unitary ring with no zero divisors. A principal ideal domain (PID) is an integral domain in which every ideal can be generated by one element. A unique factorization domain (UFD) is an integral domain in which factorization of integers into primes is unique. (more details later). An integral domain R is said to be a Euclidean ring if for every a≠0 in R there is a defined integer d(a) such that: For all a,b € R, both non zero, d(a) ≤d(ab). For all a,b € R, both non zero, there exists t,r € R such that a=tb+r where either r=0 or d(r) < d(b). A subfield of Є is called a Euclidean field if its set of integers (to be defined later) is a Euclidean ring. Let n be an integer.n is said to be square free if n is not divisible by the square of an integer. Note that: Every Euclidean ring is a PID, but the converse is false. Every PID is a UFD, but the converse is false. | en_US |
dc.format.extent | ii, 44 leaves | |
dc.language.iso | en | en_US |
dc.publisher | Notre Dame University-Louaize | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject.lcsh | Quadratic fields | |
dc.subject.lcsh | Polynomials | |
dc.subject.lcsh | Euclidean algorithm | |
dc.title | Unique factorization in quadratic fields | en_US |
dc.type | Thesis | en_US |
dc.rights.license | This work is licensed under a Creative Commons Attribution-NonCommercial 3.0 United States License. (CC BY-NC 3.0 US) | |
dc.contributor.supervisor | Tarabay, Ajaj A., Ph.D. | en_US |
dc.contributor.department | Notre Dame University-Louaize. Department of Mathematics and Statistics | en_US |
The following license files are associated with this item: