74
SOLUTION MEGATHREAD-🎄- 2022 Day 11 Solutions -🎄-(self.adventofcode)
submitted 3 years, 1 month ago* (edited 17 minutes after) by daggerdragon to /r/adventofcode (134.8k)
WIKI NEWS
- The FAQ section of the wiki on [Code Formatting](https://www.reddit.com/r/adventofco...
since 3 years, 1 month ago
4 of 4
Tip Reveddit Real-Time can notify you when your content is removed.
your account history
Tip Check if your account has any removed comments.
view my removed comments you are viewing a single comment's thread.
view all comments
this isn't CRT, it's just that (a mod kn) mod n = a mod n for any integer k. no need for any prime or coprime numbers.
You're right, of course. This is the price of writing my justifications at midnight.
However, it is the case that we know that the LCM of all the divisors is their product because they are coprime. This likely doesn't impact the solution anyways though.
Even more than relatively prime, they're all just completely prime (for me at least)