Quick & Easy Chinese Remainder Theorem Method 🚀 — No Modular Inverses Needed
Learn a simple 2-minute technique to solve systems of congruences using the Chinese Remainder Theorem, perfect for coding challenges like Advent of Code Day 13. No modular inverses required!
Errichto Algorithms
102.2K views • Jan 24, 2021
About this video
A simple method for Chinese Remainder Theorem (solving system of congruences), without any modular inverse. Here's my code for Advent of Code day 13 https://github.com/Errichto/youtube/blob/master/AOC-2020/13-search/shuttle2.cpp
0:00 Example 1
2:02 In General
2:56 LCM
4:05 Big Example
7:31 Extra Understanding
Subscribe for more educational videos on algorithms, coding interviews and competitive programming.
- Github repository: https://github.com/Errichto/youtube
- Live streams on 2nd YT channel and on Twitch: https://www.youtube.com/errichto2 & https://www.twitch.tv/errichto
- FB and Twitter: https://www.facebook.com/errichto & https://twitter.com/errichto
- Frequently Asked Questions: https://github.com/Errichto/youtube/wiki/FAQ
0:00 Example 1
2:02 In General
2:56 LCM
4:05 Big Example
7:31 Extra Understanding
Subscribe for more educational videos on algorithms, coding interviews and competitive programming.
- Github repository: https://github.com/Errichto/youtube
- Live streams on 2nd YT channel and on Twitch: https://www.youtube.com/errichto2 & https://www.twitch.tv/errichto
- FB and Twitter: https://www.facebook.com/errichto & https://twitter.com/errichto
- Frequently Asked Questions: https://github.com/Errichto/youtube/wiki/FAQ
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
102.2K
Likes
2.3K
Duration
8:48
Published
Jan 24, 2021
User Reviews
4.7
(20) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.