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”. MoreGamesNow wrote:Modulo is a really neat operation. set to repeat change by if > do something else do something else end end The third way I often use modulus is if I am doing something a lot of times, but every 100 times I want to do something else. In fact the formula is “X = ((T - 1) mod 8) + 1”. The y coordinate can be found with division and rounding, but to find the x coordinate we need to use modulus. An interesting question, then, is to say “if I have a tile, how do I get it's x and y coordinate?”. Usually the first element stores what is one the top-left corner, the second element stores the piece on the tile next to it, etc. Many people like to store their boards in a list, where each item says what piece is on a certain tile. For example: - 23 mod 10“ is 3 - ”217 mod 10“ is 7 - ”1945 mod 10“ is 5 Or the ones and ten's place of a number - 23 mod 100” is 23 - “217 mod 100” is 17 - “1945 mod 100” is 45 It is also useful when dealing with grids, or, to give a practical application, with chessboards). You can also use it to find out what the one's place of a number is. In other words: is the same as asking “is x even”. As mentioned above, you can check to see if a number is even by seeing if it is divisible by 2. second: how much should you take away from the first number to make it divisible by the second number - third: the remainder of a division problem It has a number of uses in scripting. So, you can think of modulo in two different ways: - first: if you keep taking away the second number from the first number, how much do you have left in the end.
If we take away 1 from 21, we get the biggest number that is divisible by 4 and less than to 21. In fact, the "1' we get from 21 tells us how much we need to take away from 21 to make it divisible by 4. 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.
0 kommentar(er)
