Linear Congruences: Application of Modular Arithmetic | Lecture 17 | Discrete Structures | CSIT, TU

Welcome to The Digital Nerds, your premier source for comprehensive Computer Science courses, meticulously curated from prestigious Nepalese universities. I'm Anjesh Kafle, a computer engineer and seasoned educator dedicated to delivering a tailored educational experience that meets your academic aspirations. While our focus is on bringing Nepalese universities' expertise to the forefront, our content's universal relevance ensures its value extends globally. Here at The Digital Nerds, we're not just about teaching – we're about inspiring curiosity, fostering a learning environment, and preparing you for a world that's increasingly digital. Let's embark on this exciting journey of learning together! ------ In this video, we discuss the concepts of Linear Congruences, and explore the process of normalizing a linear congruence by multiplying the coefficient of the equation with it's multiplicative inverse under the same modulus. It then outlines the case where we might want to solve multiple congruences simultaneously, hinting towards the Chinese Remainder Theorem. Then it diverts towards the discussion for Cryptology and Caesar Cipher, keeping the Chinese Remainder Theorem for the next video. This video belongs to the playlist: Discrete Structures Full Course for Tribhuwan University, under the BSc CSIT programme. ------ Chapters: 0:00 Scope of the Video 1:30 Linear Congruences 11:22 Cryptology ------ Make sure to like, share and subscribe! ------ Credits: Text-Book: Kenneth H. Rosen | Discrete Mathematics and its Applications Kolman | Discrete Mathematical Structures ------ References: Previous Video:    • Integer Operations: Division, Modular Expo...   Next Video:    • Chinese Remainder Theorem | Lecture 18 | D...   My Freelancing Profile: https://www.fiverr.com/googlesheetspro Our Facebook Page:   / 100095563598803   ------ All content is for educational purposes only. ------ Keywords: discrete structures, discrete mathematics, csit, course series, computer science, number theory, congruence, linear congruence, system of linear congruences, euclidean algorithm, extended euclidean algorithm, modulo multiplicative inverse