Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is there a quick way for me to tell (quick rejection) whether a binary number when divided by another one has a remainder of 0 or not? I don’t want to have to carry out the entire division. For example, dividing 1001 0110 1011 1110 by 11011. No carry is required.
This is for a networking project.
No, not in general.
Certain special cases can be checked quickly, like if the divisor is a power of two, but there are no shortcuts for the general problem.
Aside: although the shortcuts for special cases necessarily use the encoding of the number, whether or not a division produces a remainder is a property of the numbers involved, not their encodings.