I have already discussed clock arithmetic, modulo division, and number bases. We further our discussion in this post by learning how to change numbers from one base to another.
The number system that we are using everyday is called the decimal number system or the base 10 number system (deci means 10). It is believed that this system was developed because we have 10 fingers.
In the base 10 system, the digits are composed of 0 up to 9. Adding 1 to 9, the largest digit in this system, will give us 10. That is, we replace 9 in the ones place with 0, and add 1 to the tens place which is the next larger place value.
Another way to write a number in base 10 is by multiplying its digits by powers of 10 and adding them. For example, the number 2578 can be rewritten in expanded form as
. » Read more
Although I have already discussed modulo division, I believe that this proof is beyond the reach of average high school students. To explain further, I made additional notes on Patrick’s proof . I hope these explanations would be able to help students who want to delve on the proof.
I’ve got a prime number trick for you today.
- Choose any prime number .
- Square it.
- Add 5.
- Divide by 8.
Having no idea which prime number you chose, I can tell you this:
The remainder of your result is 6. » Read more
This is the fourth part of the Introduction to the Modular Number Systems Series. In the previous parts, we have learned intuitively the modular systems using a 12-hour analog clock, performed operations with its numbers and introduce the symbol for congruence, and discussed the different number bases. In this post, we formally define congruence.
image via Wikipedia
Recall that the statement means that 17 gives a remainder of 5 when divided by 12, or that 17 and 5 give the same remainder when divided by 12. We have also learned that 17, 29, and 41 are congruent since all of them give the same remainder (that is 5) when divided by 12. Notice also that since all of them are congruent, » Read more