Operations on Large Integers, Zero-One Matrices | Lecture 19 | 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 look into the application of the Chinese Remainder Theorem, and it's usage in enabling modulo arithmetic with a choice of good co-prime moduli set, like 99, 98, 97 and 95. The video demonstrates how writing numbers modulo these remainders helps perform arithmetic with large integers using tuples of appropriate sizes.

The rest of the time in the video is spent discussing the ideas of Zero-One matrices and the various matrix operations: Join, Meet and Boolean Product. A couple of numerical problems are solved relating to the zero-one matrices.

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
0:44 Computer Arithmetic with Large Integers
9:33 Zero One Matrices (Boolean Matrices)
------
Make sure to like, share and subscribe!
------
Credits:
Text-Book:
Kenneth H. Rosen | Discrete Mathematics and its Applications
Kolman | Discrete Mathematical Structures
------
References:

Our Facebook Page:
------
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, chinese remainder theorem, operation on large integers, large numbers, modulo arithmetic