![]() We get 1, so 21 is almost divisible by 4, but not quite. Likewise, we can see if 21 is divisible by 4 by using ”21 mod 4". This means 24 is ”zero away“ from being divisible by 4 – in other words, it means 24 is divisible by 4. ![]() For instance, to check if 24 is divisible by 4, we do ”24 mod 4“ and get 0. For instance 16 mod 3 is 1, and 16 divided by 3 is "4 with a remainder of 1“ Some common uses are to check if a number is divisible by another number. You can also think of it as giving you the “remainder” after you do division. ![]() Well if you take away 2 form 17 you get 15, which is divisible by 5, so 17 is “2 away” form being divisible by 5. Another way to think of it is “how close is 17 to being divisible by 5”. ![]() You can't take away 5 from 2 (without going below zero!) so “17 mod 5” is equal to 2. In this case if you take away one 5 from 17 you get 12. Basically “17 mod 5” it answers the question “if I keep taking away 5s from 17, what number do I end up with”.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |