MATH2400: Finite Mathematics

- 2 x class tests (20% each)
- Final exam (60%)

Pre-requisites are either MATH1081 or MATH1231/1241/1251 or DPST1014. Highly recommend doing this course after or with MATH1081.

I didn't have to do this course but it ended up being one of my favourite courses this term. The course has given me a new profound appreciation towards MATH3711. The course goes through a lot of the abstract algebra concepts you would find in a course like MATH3711 without getting bogged down in the details of proofs. (Don't worry, there are proofs in the course but the focus is more on the applications of the concepts). Think of it as an introductory course to algebra and not the algebra you find in high school!

The course is designed to be taken alongside MATH2859 (hence, the 3UOC instead of the normal 6UOC). Don't get confused between 3UOC and the workload however! The workload is about the same as a normal 6UOC course and you should treat it as such.
The first half of the course is a revision of the number theory components of MATH1081. You revisit concepts such as the Euclidean Algorithm and divisibility. You then cover other algebraic structures such as groups, (commutative) rings and fields which become an integral part of the second half of the course (coding and information theory). So if you enjoyed modular arithmetic in MATH1081, this is a great follow up course for you to do! On the other hand, if you enjoyed MATH3411 and want to do a bit more on coding theory, then this course is also a great course for you!

- 2 x 2 hour live lecture.
- 1 x 1 hour live lecture.
- 1 x 1 hour tutorial.

2/5 (although having done MATH3711 and MATH3411 beforehand played a major role in this difficulty score; it would probably be around 3.5-4/5 for someone coming into the course with only MATH1081 or MATH1231)

Yes.

- Lecturer: Prof. Igor Shparlinski.

Lecture slides are sufficient.

4.5/5

No textbooks for the course.

2021, Term 2

97 HD.