Corso Vittorio Emanuele II, 39 - Roma 0669207671

Ingegneria Informatica/Information and communication technologies engineering (with Helwan University) (Academic Year 2006-2007)

Discrete Mathematics


CFU: 5
Content language:
Course description
The course gives an introduction to discrete mathematical techniques and their applications.
Prerequisites
Basic combinatorial calculus.
Program
- Induction principle.
- Binomial coefficients and Newton formula.
- Recursive problems. Examples: Hanoi tower, Josephus problem.
- Recurrence relations. Generating functions. Examples: Fibonacci and Bernoulli sequences.
- Elementary number theory.
Professor/Tutor responsible for teaching
Professor not available
List of lessons
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
    •  Lesson n. 8: Tower of Hanoi  Go to this lesson
Mashhoor Refai
Mashhoor Refai
    •  Lesson n. 10: Counting  Go to this lesson
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
    •  Lesson n. 20: Prime Numbers  Go to this lesson
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
Mashhoor Refai
    •  Lesson n. 24: Congruence  Go to this lesson
Mashhoor Refai
Mashhoor Refai