negative binary subtraction using 2's complement (and 5 bit representation)
$begingroup$
I'm wanting to carry out the calculation of 8 - 11 (assuming that 5 bits represents a number and also using 2s complement representation), however, I can't seem to get the correct answer. This is what I have so far;
8 in binary is 01000.
11 in binary is 01101, which we invert to get -11: 10010 and then add one => 10011.
Adding these together (8 + -11) I thought resulted in 11100, however, when converting this back to decimal I can see that this isn't the (final) answer. Does anyone know where I'm going wrong?
binary
asked Nov 5 '17 at 19:25
Alice SAlice S
11
$endgroup$
add a comment |
$begingroup$
I'm wanting to carry out the calculation of 8 - 11 (assuming that 5 bits represents a number and also using 2s complement representation), however, I can't seem to get the correct answer. This is what I have so far;
8 in binary is 01000.
11 in binary is 01101, which we invert to get -11: 10010 and then add one => 10011.
Adding these together (8 + -11) I thought resulted in 11100, however, when converting this back to decimal I can see that this isn't the (final) answer. Does anyone know where I'm going wrong?
binary
asked Nov 5 '17 at 19:25
Alice SAlice S
11
$endgroup$
add a comment |
$begingroup$
I'm wanting to carry out the calculation of 8 - 11 (assuming that 5 bits represents a number and also using 2s complement representation), however, I can't seem to get the correct answer. This is what I have so far;
8 in binary is 01000.
11 in binary is 01101, which we invert to get -11: 10010 and then add one => 10011.
Adding these together (8 + -11) I thought resulted in 11100, however, when converting this back to decimal I can see that this isn't the (final) answer. Does anyone know where I'm going wrong?
binary
asked Nov 5 '17 at 19:25
Alice SAlice S
11
$endgroup$
I'm wanting to carry out the calculation of 8 - 11 (assuming that 5 bits represents a number and also using 2s complement representation), however, I can't seem to get the correct answer. This is what I have so far;
8 in binary is 01000.
11 in binary is 01101, which we invert to get -11: 10010 and then add one => 10011.
Adding these together (8 + -11) I thought resulted in 11100, however, when converting this back to decimal I can see that this isn't the (final) answer. Does anyone know where I'm going wrong?
binary
binary
asked Nov 5 '17 at 19:25
Alice SAlice S
11
asked Nov 5 '17 at 19:25
Alice SAlice S
11
asked Nov 5 '17 at 19:25
Alice SAlice S
11
asked Nov 5 '17 at 19:25
Alice SAlice S
11
asked Nov 5 '17 at 19:25
Alice SAlice S
11
11
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You representation of $11$ is wrong (you actually compute with $-13$), here the steps to get $8-11 = -3$
8 = 01000
-11 = inv(01011)+1 = 10100+1 = 10101
01000
+ 10101
= 11101
Now compute $-3$ and see that results match:
-3 = inv(00011)+1 = 11100+1 = 11101
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2506356%2fnegative-binary-subtraction-using-2s-complement-and-5-bit-representation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You representation of $11$ is wrong (you actually compute with $-13$), here the steps to get $8-11 = -3$
8 = 01000
-11 = inv(01011)+1 = 10100+1 = 10101
01000
+ 10101
= 11101
Now compute $-3$ and see that results match:
-3 = inv(00011)+1 = 11100+1 = 11101
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
$endgroup$
add a comment |
$begingroup$
You representation of $11$ is wrong (you actually compute with $-13$), here the steps to get $8-11 = -3$
8 = 01000
-11 = inv(01011)+1 = 10100+1 = 10101
01000
+ 10101
= 11101
Now compute $-3$ and see that results match:
-3 = inv(00011)+1 = 11100+1 = 11101
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
$endgroup$
add a comment |
$begingroup$
You representation of $11$ is wrong (you actually compute with $-13$), here the steps to get $8-11 = -3$
8 = 01000
-11 = inv(01011)+1 = 10100+1 = 10101
01000
+ 10101
= 11101
Now compute $-3$ and see that results match:
-3 = inv(00011)+1 = 11100+1 = 11101
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
$endgroup$
You representation of $11$ is wrong (you actually compute with $-13$), here the steps to get $8-11 = -3$
8 = 01000
-11 = inv(01011)+1 = 10100+1 = 10101
01000
+ 10101
= 11101
Now compute $-3$ and see that results match:
-3 = inv(00011)+1 = 11100+1 = 11101
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
edited Nov 5 '17 at 20:37
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
answered Nov 5 '17 at 20:31
gammatestergammatester
16.7k21733
16.7k21733
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2506356%2fnegative-binary-subtraction-using-2s-complement-and-5-bit-representation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
