Tag: modulus

Mar 09 2016

Unsigned Binary Integers and Internal Congruence

This is going to be another one of my “selfish” posts – written primarily for me to refer back to in the future and not because I believe it will benefit anyone other than me. The idea is one that I always took for granted but had a hard time proving to myself once I decided …

Continue reading

Jan 12 2016

Modular Exponentiation Rule Proof

It is no big secret that exponentiation is just multiplication in disguise. It is a short hand way to write an integer times itself multiple times and is especially space saving the larger the exponent becomes. In the same vein, a serious problem with calculating numbers raised to exponents is that they very quickly become …

Continue reading

Jan 02 2016

Modular Multiplication Rule Proof

I must stay focused. I must stay focused. I must stay … I wonder what’s new on Facebook. I don’t really feel like writing this post mostly because I know that it will be very similar to the other two I have already done: modular addition rule proof and modular subtraction rule proof, but my New …

Continue reading

Dec 31 2015

Modular Subtraction Rule Proof

I’ve already presented and proved the rule for modular addition, so for a sense of completeness, but mostly to satisfy my OCD, now I’ll cover the rule for modular subtraction. When doing subtraction in modular arithmetic, the rule is: If we subtract integer from integer and calculate the difference modulo , we get the same answer …

Continue reading

Dec 31 2015

Modular Addition Rule Proof

Addition in modular arithmetic is much simpler than it would first appear thanks to the following rule: This says that if we are adding two integers and and then calculating their sum modulo , the answer is the same as if we added modulo to modulo and then calculated that sum modulo . Note that …

Continue reading