answersLogoWhite

0

The remainder of the division, by 4, is a number between 0 and 3. In the case of binary, this would maintain the last two bits of the original number.

User Avatar

Wiki User

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin

Add your answer:

Earn +20 pts
Q: What happens to a binary number n if you compute n mod 4?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

How do you find the multiplicative inverse of a number mod a number?

Formally, a number n, has an inverse mod p only if p is prime. The inverse of n, mod p, is one of the numbers {0, 1, 2, ... , k-1} such that n*(p-1) = 1 mod p If p is not a prime then: if n is a factor of p then there is no such "inverse"; and if n is not a factor of p then there may be several possible "inverses".


What is meant by modulus of any number?

One number "modulo" another number indicates the remainder after division of the first number by the second. For example, the integer result of 11 / 2 is 5 with a remainder of 1, so 11 mod 2 = 1. (In fact, any odd number mod 2 = 1.)


What number containing the numbers 1 through 9 with all numbers only used once is divisible by all the numbers from 1 through 9?

36288 WRONG!(1*2*3*4*5*6*7*8*9)/10 WRONG!I obviously misreads the question. after writing a simple visual basic program, see below. I am changing my answer to "does not exist." as the program failed to return a value.Private Sub Command0_Click()Dim i As Longi = 1Do While i Mod 9 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 8 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 7 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 6 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 5 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 4 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 3 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 2 > 0 Or i Mod 10 = 0i = i + 1LoopLoopLoopLoopLoopLoopLoopLoopMsgBox iEnd Sub


What number divided by 3 has a remainder of 2 and divided by five has a remainder of three?

x = 2 mod 3; x = 3 mod 5. Equivalently, x = 3m + 2 = 5n + 3. One such number is 23; others could be found.


What is the only even number that is an odd number?

None. And any attempts to say other wise are defeated in higher math. Even 0 is considered even by way of being 0 in mod(2). (similarly, 1 is odd by being 1 in mod(2) )