Skip to main content
Till KTH:s startsida Till KTH:s startsida

LT1001 Discrete Mathematics 7.5 credits

The need for professionals with adequate mastery of mathematics and mathematics didactics competencies is crucial for bringing the many innovations to reality. This course is designed to equip students with the knowledge of the pervasive and invisible roles of mathematics in this digital society. You are not only introduced to the various mathematical concepts and their applications, but skills, processes, and knowledge that will prepare you for the challenges in the 21st-century environment.

Choose semester and course offering

Choose semester and course offering to see current information and more about the course, such as course syllabus, study period, and application information.

Application

For course offering

Spring 2025 Start 14 Jan 2025 programme students

Application code

61705

Headings with content from the Course syllabus LT1001 (Spring 2023–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

This course is designed to help the students to develop basic technical proficiency in discrete mathematics that is used in natural sciences and engineering and to solve everyday problems. The course aims also to help students to develop and apply logic for quantified statements, precision and language to achieve mathematical certainty in problem-solving. Content that is brought up:

·        The concept of discrete mathematics

·        Arithmetic algorithms

·        Modulo calculations

·        Polynomials

·        Set theory

·        Functions and relations

·        Number sequences (arithmetic or geometric)

·        Basic combinatorial methods

·        Algebraic structures

·        Basic graph theory

Intended learning outcomes

After passing the course, the student should be able to:

1. perform operations on functions Use Euclid's algorithm to calculate the greatest common divisor to two integers a and b and I see solve the Diophantine equation ax + by = c

2. Use Euclid's algorithm to calculate the greatest common divisor to two polynomials

3. Use knowledge in discrete mathematics to solve combinatorial problems and permutations

4. Use Lagrange's theorem for groups

5. Explain the concepts of sub-groups, coset and the order of elements

6. Explain basic concepts in graph theory such as: isomorphism, degree (valency), coherence, path, cycle, Hamiltonian cycle and Eulerian circuit

Literature and preparations

Specific prerequisites

General entry requirements.

Recommended prerequisites

No information inserted

Equipment

No information inserted

Literature

No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

A, B, C, D, E, FX, F

Examination

  • KON1 - Partial exam, 2.0 credits, grading scale: A, B, C, D, E, FX, F
  • PRO1 - Project, 2.0 credits, grading scale: A, B, C, D, E, FX, F
  • TEN1 - Written exam, 3.5 credits, grading scale: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted

Examiner

Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course room in Canvas

Registered students find further information about the implementation of the course in the course room in Canvas. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.

Offered by

Main field of study

Technology

Education cycle

First cycle

Add-on studies

No information inserted