Search programme

​Use the search function to search amongst programmes at Chalmers. The study programme and the study programme syllabus relating to your studies are generally from the academic year you began your studies.

Syllabus for

Academic year
MVE150 - Algebra  
Syllabus adopted 2021-02-26 by Head of Programme (or corresponding)
Owner: MPENM
7,5 Credits
Grading: TH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail
Education cycle: Second-cycle
Main field of study: Mathematics

Teaching language: English
Application code: 20142
Open for exchange students: Yes

Module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0107 Examination 7,5 c Grading: TH   7,5 c   18 Mar 2022 pm J,  08 Jun 2022 am J   15 Aug 2022 am J  

In programs



Per Salberger

  Go to Course Homepage


General entry requirements for Master's level (second cycle)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Specific entry requirements

English 6 (or by other approved means with the equivalent proficiency level)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Course specific prerequisites

Basic course in linear algebra


In swedish only

Learning outcomes (after completion of the course the student should be able to)

  • define and explain what a binary operation is.
  • define the most important algebraic structures: groups rings and fields.
  • give exmples of groups consisting of congruences of integers, matrices, permutations, and symmetries of geometric objects.
  • define what a subgroup and a coset of a subgroup is.
  • use equivalence relations to study cosets and to prove Lagrange’s theorem.
  • form quotient objects of groups and rings by means of normal subgroups and ideals.
  • define the concepts: homomorphism, isomorphism, kernel and image of a homomorphism.
  • use the Euclidean algoritm for integers and polynomials over a field and describe the corresponding theories of unique prime factorization.
  • explain the relation between finite field extensions and zeros of polynomials over the base field.


Operations, groups, subgroups, symmetries, permutations, equivalence relations and partitions, prime numbers, the fundamental theorem of arithmetic, congruences, orders of groups and elements in groups, cyclic groups, cosets and Lagrange's theorem, isomorphisms, direct product of groups, isomorphism types of finite Abelian groups, Cayley's theorem, group homomorphisms, image and kernel, normal subgroups, quotient groups, the fundamental homomorphism theorem, orbits, stabilizers, Burnside's theorem, Sylow's theorem, definition of rings and fields, integral domains, characteristic of a field, polynomial rings, the division algorithm, irreducible polynomials,Euclidean rings, unique factorization domains, ring homomorphisms, ideals, principal ideals, quotient rings, adjunction of roots of polynomials, something about the existence and construction of finite fields, zeros of polynomials, factorization in polynomial rings, various number systems.


The course consists of about 15 lectures and 15 lessons. Classes are devoted to demonstrations of the exercises in the textbook.


Durbin: Modern Algebra, John Wiley & Sons

Examination including compulsory elements

Written exam

The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.

Page manager Published: Mon 28 Nov 2016.