THE UNIVERSITY of EDINBURGH

DEGREE REGULATIONS & PROGRAMMES OF STUDY 2007/2008
- ARCHIVE for reference only
THIS PAGE IS OUT OF DATE

University Homepage
DRPS Homepage
DRPS Search
DRPS Contact
Home : College of Science and Engineering : School of Mathematics (Schedule P) : Specialist Mathematics & Statistics (Honours)

Numbers & Rings (U01632)

? Credit Points : 10  ? SCQF Level : 10  ? Acronym : MAT-3-NuR

Optional 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

? Pre-requisites : Passes at C or better in MAT-2-FoC, MAT-2-SVC, MAT-2-LiA, MAT-2-MAM

? Prohibited combinations : MAT-3-NuRO, similar courses from Mathematics 3 (Hons) prior to 2004-05

Subject Areas

Delivery Information

? Normal year taken : 3rd year

? Delivery Period : Semester 2 (Blocks 3-4)

? Contact Teaching Time : 2 hour(s) per week for 11 weeks

First Class Information

Date Start End Room Area Additional Information
08/01/2008 14:00 15:00 Lecture Theatre A, JCMB KB

All of the following classes

Type Day Start End Area
Lecture Tuesday 14:00 14:50 KB
Lecture Friday 14:00 14:50 KB

Summary of Intended Learning Outcomes

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

Examination only.

Exam times

Diet Diet Month Paper Code Paper Name Length
1ST May 1 - 2 hour(s)

Contact and Further Information

The Course Secretary should be the first point of contact for all enquiries.

Course Secretary

Mrs Catriona Galloway
Tel : (0131 6)50 4885
Email : C.Galloway@ed.ac.uk

Course Organiser

Dr Toby Bailey
Tel : (0131 6)50 5068
Email : t.n.bailey@ed.ac.uk

Course Website : http://student.maths.ed.ac.uk

School Website : http://www.maths.ed.ac.uk/

College Website : http://www.scieng.ed.ac.uk/

Navigation
Help & Information
Home
Introduction
Glossary
Search
Regulations
Regulations
Degree Programmes
Introduction
Browse DPTs
Courses
Introduction
Humanities and Social Science
Science and Engineering
Medicine and Veterinary Medicine
Other Information
Prospectuses
Important Information
Timetab
 
copyright 2007 The University of Edinburgh