THE UNIVERSITY of EDINBURGH

DEGREE REGULATIONS & PROGRAMMES OF STUDY 2010/2011
- ARCHIVE as at 13 January 2011 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 (Ord) (MATH09017)

Course Outline
School School of Mathematics College College of Science and Engineering
Course type Standard Availability Available to all students
Credit level (Normal year taken) SCQF Level 9 (Year 3 Undergraduate) Credits 10
Home subject area Mathematics Other subject area Specialist Mathematics & Statistics (Ordinary)
Course website http://student.maths.ed.ac.uk Taught in Gaelic? No
Course description 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
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 Applicable Mathematics 3 (Phys Sci) (MATH08015) AND Mathematical Methods 3 (Phys Sci) (MATH08016) AND Applicable Mathematics 4 (Phys Sci) (MATH08017) AND Mathematical Methods 4 (Phys Sci) (MATH08018) OR Mathematics for Informatics 3 (MATH08013) AND Mathematics for Informatics 4 (MATH08025)
Co-requisites
Prohibited Combinations Students MUST NOT also be taking Numbers & Rings (MATH10023)
Other requirements None
Additional Costs None
Information for Visiting Students
Pre-requisites None
Displayed in Visiting Students Prospectus? Yes
Course Delivery Information
Not being delivered
Summary of Intended Learning Outcomes
The following are the learning objectives for the Honours version, MAT-3-NuR; for this (Ordinary) version there is more emphasis on the technical, rather than conceptual elements, which will be reflected by a different examination.

1. To be able to use the division algorithm and euclidean algorithm in apppropraiate 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
Coursework: 15%; Degree Examination: 85%.
Special Arrangements
None
Additional Information
Academic description Not entered
Syllabus Not entered
Transferable skills Not entered
Reading list Not entered
Study Abroad Not entered
Study Pattern Not entered
Keywords Not entered
Contacts
Course organiser Dr Bruce Worton
Tel: (0131 6)50 4884
Email: Bruce.Worton@ed.ac.uk
Course secretary Mrs Kathryn Mcphail
Tel: (0131 6)50 4885
Email: k.mcphail@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
Timetab
Prospectuses
Important Information
 
copyright 2011 The University of Edinburgh - 13 January 2011 6:20 am