Chapter 7: Number Theoretic Algorithms — Design and Analysis of Algorithms (CSC325) Notes

Euclid's & Extended Euclid's algorithms, modular linear equations, Chinese Remainder Theorem, Miller-Rabin primality test.

Core Course
Ch. 7: Number Theoretic Algorithms

Notes Arriving Soon

Handwritten chapter notes for this subject are currently being digitized. Help your fellow students by contributing your notes!

Ch. 6: BacktrackingCh. 8: NP Completeness

Topics & Key Objectives in Chapter 7

Euclid's & Extended Euclid's algorithmsmodular linear equationsChinese Remainder TheoremMiller-Rabin primality test.

Related Study Resources for Design and Analysis of Algorithms (CSC325)

Subject HubDesign and Analysis of Algorithms (CSC325)Official CurriculumDesign and Analysis of Algorithms SyllabusTU Board PapersDesign and Analysis of Algorithms Past QuestionsSemester Directory5th Sem Subjects