MATH 2103 • Midterm II • Discrete Mathematics
Bu ders ile hem bir sürü soru çözmüş, hem kendini denemiş, hem de konuların püf noktalarını öğrenmiş olacaksın.
Kolayca yüksek notlar alabilmen için özenle hazırlanmış video derslerlerimizi izle. Çıkma ihtimali yüksek ve çıkmış soruların soru çözümleriyle sınava en iyi şekilde hazırlan. Hızını sen ayarla. İstediğin yerde hızlandırır, dersleri istediğin kadar tekrar et.
433 TL a month, 3 instalments at no extra cost
Instructor
İhsan Altundağ
Eğitmen
2007 yılında Galatasaray Üniversitesi Bilgisayar Mühendisliği bölümünden birincilikle mezun olduktan sonra Fransa'da Kriptoloji üzerine Fransa hükümeti tarafından verilen bursla yüksek lisans yaptım. Devamında ikinci kez sınava girerek Boğaziçi Matematik bölümünü de bitirdim. Yaklaşık 15 yıldır üniversite öğrencilerine dersler vermekteyim.
Pass guarantee
We trust our courses. If you prepare for your exams with us and still fail the course, you can get a refund. Terms
Topics
Divisibility and Modular Arithmetic
24 topic lessons
Definition of Divisibility
Example 1
Example 2
Example 3
Division Algorithm
Definition of Modular Arithmetic
Example 1
Properties of Modular Arithmetic
Example 1
Example 2
Prime Numbers
Example 1
Example 2
Example 3
GCD Greatest Common Divisor
LCM Least Common Multiple
Example 1
Euclidian Algorithm
Example 1
Bézout Identity
Example 1
Example 2
Example 3
Fermat' Little Theorem
Past Midterm Problems I
8 questions
Modular Arithmetic- True False
Modular Arithmetic
Modular Arithmetic
Euclidian Algorithm
Euclidian Algorithm & Bezout Theorem
Euclidian Algorithm & Bezout Theorem
Euclidian Algorithm & Bezout Theorem
Euclidian Algorithm & Bezout Theorem
Mathematical Induction & Strong Induction
15 topic lessons
Introduction
Proof of Formulas by Induction
Example 1
Example 2
Example 3
Example 4
Proof of Divisibility by Induction
Example 1
Example 2
Proof of Inequality by Induction
Example 1
Example 2
Induction Related to Fibonacci
Strong Induction
Example
Recursive Definition and Structural Induction
10 topic lessons
Introduction
Recursively Defined Functions
Example 1
Recursively Defined Sets
Example 2
Recursively Defined Strings
Example 3
Structural Induction
Example 4
Example 5
Past Midterm Problems II
11 questions
Induction for Formulas 1
Induction for Formulas 2
Induction for Formulas 3
Induction for Formulas 4
Induction Proof for Divisibility 1
Induction Proof for Divisibility 2
Induction for Inequalities
Induction with Fibonacci
Strong Induction
Strong Induction
Recursion and Induction
Basics of Counting
11 topic lessons
Basic Principles of Counting
Counting Examples
Permutations
Permutations Example
Groups and Circular Permutation Example
Identical Objects Example 1
Identical Objects Example 2
Combination
n choose r
Committee Example
Ball Example
Pigeonhole Principle & Principle Inclusion-Exclusion
9 topic lessons
Pigeonhole Principle
Example 1
Example 2
Example 3
Example 4
Example 5
Principle Inclusion Exclusion
Example 1
Example 2
Past Midterm Problems III
15 questions
Basics of Counting
Basics of Counting
Basics of Counting
Basics of Counting
Basics of Counting
Basics of Counting
Basics of Counting
Pigeonhole Principle
Pigeonhole Principle
Pigeonhole Principle
Pigeonhole Principle
Pigeonhole Principle
Pigeonhole Principle
Principle Inclusion - Exclusion
Principle Inclusion - Exclusion
Complete the bundle
🎓 92% of Işık Üniversitesi students study with the whole bundle.
