THE UNIVERSITY of EDINBURGH

DEGREE REGULATIONS & PROGRAMMES OF STUDY 2013/2014 -
- ARCHIVE as at 1 September 2013 for reference only
THIS PAGE IS OUT OF DATE

University Homepage
DRPS Homepage
DRPS Search
DRPS Contact
DRPS : Course Catalogue : School of Mathematics : Mathematics

Undergraduate Course: Numbers & Rings (MATH10023)

Course Outline
SchoolSchool of Mathematics CollegeCollege of Science and Engineering
Course typeStandard AvailabilityAvailable to all students
Credit level (Normal year taken)SCQF Level 10 (Year 3 Undergraduate) Credits10
Home subject areaMathematics Other subject areaSpecialist Mathematics & Statistics (Honours)
Course website https://info.maths.ed.ac.uk/teaching.html Taught in Gaelic?No
Course descriptionOptional course for Honours Degrees involving Mathematics and/or Statistics. Syllabus summary: Factorisation theory of integers and polynomials in one variable over a field. Euclidean domains. Unique Factorisation Domains. Congruences and modular arithmetic. Ideals and quotient rings. Gauss's Lemma and the Eisenstein criterion for irreducibility of polynomials over the integers.
Entry Requirements (not applicable to Visiting Students)
Pre-requisites Students MUST have passed: ( Foundations of Calculus (MATH08005) AND Several Variable Calculus (MATH08006) AND Linear Algebra (MATH08007) AND Methods of Applied Mathematics (MATH08035)) OR ( Mathematics for Informatics 3a (MATH08042) AND Mathematics for Informatics 3b (MATH08043) AND Mathematics for Informatics 4a (MATH08044) AND Mathematics for Informatics 4b (MATH08045))
Co-requisites
Prohibited Combinations Other requirements None
Additional Costs None
Information for Visiting Students
Pre-requisitesNone
Displayed in Visiting Students Prospectus?Yes
Course Delivery Information
Not being delivered
Summary of Intended Learning Outcomes
1. To be able to use the division algorithm and euclidean algorithm in appropriate settings.
2. To be able to apply the Eisenstein criterion for irreducibility of integer polynomials.
3. To understand the necessity for rigorous proofs, as exemplified by the confusions due to assuming unique factorisation is universally applicable.
4. To understand the idea of defining operations on sets defined by equivalence relations and to understand the notion of 'well-defined' for such definitions.
5. To understand the abstract notions of ideals and factor rings and to be able to work with these notions in elementary situations.
6. Given an irreducible polynomial over a field, to be able to construct an extension field that contains a root of the polynomial.
Assessment Information
Examination only.
Special Arrangements
None
Additional Information
Academic description Not entered
Syllabus Not entered
Transferable skills Not entered
Reading list http://www.readinglists.co.uk
Study Abroad Not entered
Study Pattern Not entered
KeywordsNuR
Contacts
Course organiserDr Agata Smoktunowicz
Tel:
Email: A.Smoktunowicz@ed.ac.uk
Course secretaryDr Jenna Mann
Tel: (0131 6)50 4885
Email: Jenna.Mann@ed.ac.uk
Navigation
Help & Information
Home
Introduction
Glossary
Search DPTs and Courses
Regulations
Regulations
Degree Programmes
Introduction
Browse DPTs
Courses
Introduction
Humanities and Social Science
Science and Engineering
Medicine and Veterinary Medicine
Other Information
Combined Course Timetable
Prospectuses
Important Information
 
© Copyright 2013 The University of Edinburgh - 10 October 2013 4:51 am