Tag Archives: Chinese

Chinese Remainder Theorem proof

Posted on April 10, 2019 by Brent

In my previous post I stated the Chinese Remainder Theorem, which says that if and are relatively prime, then the function is a bijection between the set and the set of pairs (remember that the notation means the set ). … Continue reading →

Posted in modular arithmetic, number theory | Tagged , , , | 2 Comments

More words about PWW #25: The Chinese Remainder Theorem

Posted on April 5, 2019 by Brent

In a previous post I made images like this: And then in the next post I explained how I made the images: starting in the upper left corner of a grid, put consecutive numbers along a diagonal line, wrapping around … Continue reading →

Posted in modular arithmetic, number theory, posts without words | Tagged , , , , | 3 Comments

A few words about PWW #25

Posted on March 9, 2019 by Brent

In my previous post I made images like this: What’s going on? Well, first, it’s easy to notice that each grid starts with in the upper-left square; is one square down and to the right of , then is one … Continue reading →

Posted in modular arithmetic, number theory, posts without words | Tagged , , , , | 4 Comments