Brave Search

computational operation

In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the latter being called the modulus of the operation. … Wikipedia

Wikipedia

en.wikipedia.org › wiki › Modulo

Modulo - Wikipedia

1 week ago - In mathematics, the result of the modulo operation is an equivalence class, and any member of the class may be chosen as representative; however, the usual representative is the least positive residue, the smallest non-negative integer that belongs to that class (i.e., the remainder of the ...

Variants of the definition Notation Common pitfalls Performance issues Properties (identities)In programming languages Generalizations

CalculatorSoup

calculatorsoup.com › calculators › math › modulo-calculator.php

Modulo Calculator

Modulo calculator finds a mod b, the remainder when a is divided by b. The modulo operation returns the remainder in division of 2 positive or negative numbers or decimals.

Discussions

Can someone explain the modulo operation to me like I'm five? (Credit.c)

It's the remainder you get from division. Let's say you were dividing 6 by 3. 3 goes two times in 6 and leaves no remainder. So 6 % 3 is 0. Now, if you were dividing 5 by 3, 3 goes once in 5 and that leaves 2. So 5 % 3 is 2. Let's do some more digits. Let's say we have a number like 824. If we divide this by 10 we get 82 with a remainder of 4. Now if divide 591 by 10, that leaves us with a remainder of 1. Divide 600 by 10, and you get a remainder of zero. 600 % 10 is zero. So we can always get the last digit in a number by using % 10. If you take an integer in C and divide by 10, that's the same as chopping off the rightmost digit, since integer division always rounds down. So if you want to go through a number, digit by digit, you loop through it by first doing % 10 to get the last digit, and doing /= 10 to get to the next digit. I hope that helped. More on reddit.com

r/cs50

7

31

April 24, 2020

Struggling to understand the modulus operator when the number being divided BY is smaller than the number dividing.

Here's the ELI5 version (which may sound kind of condescending, for which I apologize but then again, you are 5 years old): a / b asks the question: given a objects and b people, how many objects can each person get? a % b asks the question: after giving each person that many objects, how many objects remain? Therefore, 10 / 6 yields 1, because if you have 10 donuts and 6 people, each person can get one donut. 10 % 6 yields 4, because once you've given every person a donut, there are 4 donuts remaining. 6 / 10 yields 0, because if you have 6 donuts and 10 people, nobody can get a donut. 6 % 10 yields 6, because once you've given zero donuts to everyone, there remains 6 donuts. More on reddit.com

r/learnprogramming

26

1

October 6, 2014

Modulo operator

A modulo is a mathematical operator used in modular arithmetic You can think about modular arithmetic like how time on an analog clock works. In a 12 hr clock, if it’s currently 10, in 3 hours it will be 1, not 13. This is expressed as 10 + 3 mod 12. The modulo operator returns that result. num = (10 + 3) % 12 print(num) Would output 1. People like thinking about this as the remainder, but that’s not really accurate. For example: -1 % 4 would actually equal 3. If you think about a 4-hr clock and go back 1 hour, you end up at 3. More on reddit.com

r/learnpython

48

24

November 22, 2023

What the HELL is a modulo?

The modulo operator returns the "remainder" of a division. If you think back to your early days at school, when you first learned dividing using long divisions , you learned that for 14/4 the result is 3 and the remainder is 2. Because "4" fits "3" times in '14", but then you still have a remainder of "2" so that: 14 = 4 x 3 + 2 Now, why do they suggest using the modulo operator to get the different numbers (6, 4, 1). Well, let's start from the right. If we divide 641/10, we know that it fits 64 times inside 641 and the remainder is 1. In java terms this is: int lastDigit = 641 % 10; // 1 Now, you can repeat the same process over and over again, however, we need to "shift" the number a bit. For example, if we want to know the second digit, we first divide 641 by 10, so that we only have 64. Now we can just retrieve the last digit again by using the modulo operator: int secondDigit = 641 / 10 % 10; // = 64 % 10 = 4 Now, you should start to see a system here. You can keep doing this trick over and over again, but in stead of dividing by 10, you divide by 100, 1000, 10000, 100000, ... and you get the next digit every time. In your case, the left digit can be retrieved by using: int firstDigit = 641 / 100 % 10; // = 6 % 10 = 6 In this case, it's pretty "useless" to use the modulo operator, because if you have a number with only 3 digits, dividing by 100 will already yield the left most digit. However, let's say that our number was 1234, then we would get: int digit = 1234 / 100 % 10; // = 12 % 10 = 2 More on reddit.com

r/learnjava

31

0

July 13, 2016

Videos

05:31

YouTube

Introduction to the Modulo Operator: a mod b with a positive - YouTube

August 16, 2022

2.28K