What is b mod (a)? Answer Here

• kurt.physics
In summary, "b mod (a)" refers to the remainder of b/a and can be written as b = a*n + c, where c is the smallest positive number. This is similar to the concept of an analog clock, where the numbers repeat after 12. Modulo is used to find the remainder in division problems. It is not a new concept and has been discussed in a video from Google.
kurt.physics
I believe i say this question in a test some where, could anyone tell me what the hell b mod (a) is

It's called modulo. "b mod a" is the remainder of b/a.
Example: 8 mod 5 is 3, 6 mod 2 is 0, 7 mod 8 is 7.

if b is 15 and a is 4, then you can write

15 = 4*3 + 1

the thing that you have to plus, namely 1, is b mod a, so 15 mod 4 is 1. When you have to take the biggest integer and multiply with the a, such that you don't get a bigger number than b, then what you have to add is b mod a.

so

b = a*n+c

then b mod a = c.

where c is the smallest positive number so b = a*n+c is true

Slightly lost

you got two integers a and b. Try two write b as a integer n times a that is thry to write

b = a*n

for some integer n. You will see that this is not possible if not a devides b. So what is the next you could try, you vould try

b = a*n + c

where c in an integer. This can always be done, but c is not unique ex.

b=20 a=3 then

20 = 3*7-1 or 20 = 3*6+2 or 20 = 3*4+8

so how could we make this c unique? If we demand that c is positive and that c is the smallest number possible then it is unique, then the only answer would be

20=3*6+2

so now c is unique, and we call that c for b mod a, pronunced b modulo a.

I think modulo is easier to understand with a practical example. Think af an old analog clock with two hands and 12 numbers, it is modulo 12.

With a clock, you can't go past 12 o' clock, whenever you do, you just start from 0 again. This is excactly what modulo is. So if you have the time 14:00, we all know that it's 2 o' clock, and mathematically it's just 14 mod(12) = 2.

Hope it helps.

Kurt, just apply the division algorithm to a and b.

a/b = q and a remainder r, well, that r is the result of "a mod b"

Example: 25/4 = 6 and the remainder 1. Then, 25 mod 4 = 1I hope they're not teaching you that New Math I keep hearing about.

I hope they're not teaching you that New Math I keep hearing about.
Not exactly a new problem...

Last edited by a moderator:

1. What does "b mod (a)" mean?

"b mod (a)" is a mathematical operation that calculates the remainder when the integer b is divided by the integer a.

2. How is "b mod (a)" different from regular division?

In regular division, the result is a quotient, or a number that evenly divides into the original number. In "b mod (a)", the result is a remainder, or the amount left over after dividing.

3. What is the purpose of using "b mod (a)"?

"b mod (a)" is commonly used in computer programming and cryptography to calculate remainders and perform modular arithmetic operations.

4. Can "b mod (a)" be negative?

Yes, "b mod (a)" can be negative. The sign of the result depends on the sign of b. If b is negative, then the result will also be negative.

5. Are there any special rules or properties for "b mod (a)"?

Yes, there are several properties of modular arithmetic that apply to "b mod (a)". Some of these include the distributive property, associative property, and the fact that the remainder will always be less than the divisor a.

Replies
11
Views
1K
Replies
4
Views
946
Replies
1
Views
1K
Replies
5
Views
2K
Replies
1
Views
1K
Replies
10
Views
2K
Replies
12
Views
2K
Replies
3
Views
1K
Replies
4
Views
2K
Replies
1
Views
1K