BitNot does not flip bits in the way I expectedBitwise operators - Hamlet for MathematicaHow does Mathematica...
They call me Inspector Morse
How do you like my writing?
infinitive telling the purpose
Solving "Resistance between two nodes on a grid" problem in Mathematica
Are the terms "stab" and "staccato" synonyms?
Good allowance savings plan?
How much stiffer are 23c tires over 28c?
Why is Beresheet doing a only a one-way trip?
Aliens englobed the Solar System: will we notice?
What wound would be of little consequence to a biped but terrible for a quadruped?
Why the color red for the Republican Party
Is there any way to damage Intellect Devourer(s) when already within a creature's skull?
BitNot does not flip bits in the way I expected
Why is there a voltage between the mains ground and my radiator?
Time travel short story where dinosaur doesn't taste like chicken
Who deserves to be first and second author? PhD student who collected data, research associate who wrote the paper or supervisor?
What is the chance of making a successful appeal to dismissal decision from a PhD program after failing the qualifying exam in the 2nd attempt?
My story is written in English, but is set in my home country. What language should I use for the dialogue?
Why does the negative sign arise in this thermodynamic relation?
How to create a hard link to an inode (ext4)?
Making a sword in the stone, in a medieval world without magic
In the late 1940’s to early 1950’s what technology was available that could melt a LOT of ice?
What Happens when Passenger Refuses to Fly Boeing 737 Max?
Unreachable code, but reachable with exception
BitNot does not flip bits in the way I expected
Bitwise operators - Hamlet for MathematicaHow does Mathematica decide that Log[2,8] is integer?How is the mysterious Raw function used?Graph from binary matrix (not adjacency) respecting the original matrix positionsHow to replace the selected value in matrix with a specific digit?Performance-driven approach to using Big Data without killing the hard-driveUsing the binary search algorithm in a sorted grid
$begingroup$
Can anyone explain why the last result in these statements is not the bit-flipped version of arr?
(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) In[190]:= FromDigits[%, 2]
(Debug) Out[190]= 34
(Debug) In[191]:= BitNot[%]
(Debug) Out[191]= -35
(Debug) In[192]:= IntegerDigits[%, 2, 8]
(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}
binary
edited 1 hour ago
m_goldberg
87.4k872198
asked 3 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
|
show 4 more comments
$begingroup$
Can anyone explain why the last result in these statements is not the bit-flipped version of arr?
(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) In[190]:= FromDigits[%, 2]
(Debug) Out[190]= 34
(Debug) In[191]:= BitNot[%]
(Debug) Out[191]= -35
(Debug) In[192]:= IntegerDigits[%, 2, 8]
(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}
binary
edited 1 hour ago
m_goldberg
87.4k872198
asked 3 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
3
$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
2 hours ago
$begingroup$
Is there a work around?
$endgroup$
– bc888
2 hours ago
$begingroup$
not any I know of.
$endgroup$
– kglr
2 hours ago
$begingroup$
BitNot should yield 221
$endgroup$
– bc888
2 hours ago
5
$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so thatBitNot[n]is simply equivalent to-1-n."
$endgroup$
– Chip Hurst
2 hours ago
|
show 4 more comments
$begingroup$
Can anyone explain why the last result in these statements is not the bit-flipped version of arr?
(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) In[190]:= FromDigits[%, 2]
(Debug) Out[190]= 34
(Debug) In[191]:= BitNot[%]
(Debug) Out[191]= -35
(Debug) In[192]:= IntegerDigits[%, 2, 8]
(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}
binary
edited 1 hour ago
m_goldberg
87.4k872198
asked 3 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Can anyone explain why the last result in these statements is not the bit-flipped version of arr?
(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}
(Debug) In[190]:= FromDigits[%, 2]
(Debug) Out[190]= 34
(Debug) In[191]:= BitNot[%]
(Debug) Out[191]= -35
(Debug) In[192]:= IntegerDigits[%, 2, 8]
(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}
binary
binary
edited 1 hour ago
m_goldberg
87.4k872198
asked 3 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 1 hour ago
m_goldberg
87.4k872198
asked 3 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 1 hour ago
m_goldberg
87.4k872198
edited 1 hour ago
m_goldberg
87.4k872198
edited 1 hour ago
m_goldberg
87.4k872198
87.4k872198
asked 3 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 3 hours ago
bc888bc888
213
asked 3 hours ago
bc888bc888
213
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
3
$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
2 hours ago
$begingroup$
Is there a work around?
$endgroup$
– bc888
2 hours ago
$begingroup$
not any I know of.
$endgroup$
– kglr
2 hours ago
$begingroup$
BitNot should yield 221
$endgroup$
– bc888
2 hours ago
5
$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so thatBitNot[n]is simply equivalent to-1-n."
$endgroup$
– Chip Hurst
2 hours ago
|
show 4 more comments
3
$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
2 hours ago
$begingroup$
Is there a work around?
$endgroup$
– bc888
2 hours ago
$begingroup$
not any I know of.
$endgroup$
– kglr
2 hours ago
$begingroup$
BitNot should yield 221
$endgroup$
– bc888
2 hours ago
5
$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so thatBitNot[n]is simply equivalent to-1-n."
$endgroup$
– Chip Hurst
2 hours ago
3
3
$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
2 hours ago
$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
2 hours ago
$begingroup$
Is there a work around?
$endgroup$
– bc888
2 hours ago
$begingroup$
Is there a work around?
$endgroup$
– bc888
2 hours ago
$begingroup$
not any I know of.
$endgroup$
– kglr
2 hours ago
$begingroup$
not any I know of.
$endgroup$
– kglr
2 hours ago
$begingroup$
BitNot should yield 221
$endgroup$
– bc888
2 hours ago
$begingroup$
BitNot should yield 221
$endgroup$
– bc888
2 hours ago
5
5
$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that
BitNot[n] is simply equivalent to -1-n."$endgroup$
– Chip Hurst
2 hours ago
$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that
BitNot[n] is simply equivalent to -1-n."$endgroup$
– Chip Hurst
2 hours ago
|
show 4 more comments
4 Answers
4
active
oldest
votes
$begingroup$
I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.
twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
twosComplement[35, 8]
(* {1, 1, 0, 1, 1, 1, 0, 1} *)
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
$endgroup$
add a comment |
$begingroup$
twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
twosComplement[35, 8]
{1, 1, 0, 1, 1, 1, 0, 1}
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
$endgroup$
add a comment |
$begingroup$
FlipBits[num_Integer, len_.] :=
Module[{arr}, arr = IntegerDigits[num, 2, len];
1 - arr]
answered 2 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Without using IntegerDigits[]:
With[{n = 34},
{n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11101₂}
With[{n = 34, p = 8},
{n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11011101₂}
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
$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: "387"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
bc888 is a new contributor. Be nice, and check out our Code of Conduct.
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%2fmathematica.stackexchange.com%2fquestions%2f193136%2fbitnot-does-not-flip-bits-in-the-way-i-expected%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.
twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
twosComplement[35, 8]
(* {1, 1, 0, 1, 1, 1, 0, 1} *)
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
$endgroup$
add a comment |
$begingroup$
I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.
twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
twosComplement[35, 8]
(* {1, 1, 0, 1, 1, 1, 0, 1} *)
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
$endgroup$
add a comment |
$begingroup$
I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.
twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
twosComplement[35, 8]
(* {1, 1, 0, 1, 1, 1, 0, 1} *)
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
$endgroup$
I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.
twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
twosComplement[35, 8]
(* {1, 1, 0, 1, 1, 1, 0, 1} *)
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
answered 2 hours ago
Rohit NamjoshiRohit Namjoshi
1,2861213
1,2861213
add a comment |
add a comment |
$begingroup$
twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
twosComplement[35, 8]
{1, 1, 0, 1, 1, 1, 0, 1}
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
$endgroup$
add a comment |
$begingroup$
twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
twosComplement[35, 8]
{1, 1, 0, 1, 1, 1, 0, 1}
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
$endgroup$
add a comment |
$begingroup$
twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
twosComplement[35, 8]
{1, 1, 0, 1, 1, 1, 0, 1}
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
$endgroup$
twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
twosComplement[35, 8]
{1, 1, 0, 1, 1, 1, 0, 1}
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
answered 2 hours ago
Okkes DulgerciOkkes Dulgerci
5,3341918
5,3341918
add a comment |
add a comment |
$begingroup$
FlipBits[num_Integer, len_.] :=
Module[{arr}, arr = IntegerDigits[num, 2, len];
1 - arr]
answered 2 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
FlipBits[num_Integer, len_.] :=
Module[{arr}, arr = IntegerDigits[num, 2, len];
1 - arr]
answered 2 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
FlipBits[num_Integer, len_.] :=
Module[{arr}, arr = IntegerDigits[num, 2, len];
1 - arr]
answered 2 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
FlipBits[num_Integer, len_.] :=
Module[{arr}, arr = IntegerDigits[num, 2, len];
1 - arr]
answered 2 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 2 hours ago
bc888bc888
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 2 hours ago
bc888bc888
213
answered 2 hours ago
bc888bc888
213
213
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
$begingroup$
Without using IntegerDigits[]:
With[{n = 34},
{n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11101₂}
With[{n = 34, p = 8},
{n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11011101₂}
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
$endgroup$
add a comment |
$begingroup$
Without using IntegerDigits[]:
With[{n = 34},
{n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11101₂}
With[{n = 34, p = 8},
{n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11011101₂}
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
$endgroup$
add a comment |
$begingroup$
Without using IntegerDigits[]:
With[{n = 34},
{n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11101₂}
With[{n = 34, p = 8},
{n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11011101₂}
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
$endgroup$
Without using IntegerDigits[]:
With[{n = 34},
{n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11101₂}
With[{n = 34, p = 8},
{n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
{100010₂, 11011101₂}
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
answered 2 hours ago
J. M. is slightly pensive♦J. M. is slightly pensive
97.8k10304464
97.8k10304464
add a comment |
add a comment |
bc888 is a new contributor. Be nice, and check out our Code of Conduct.
bc888 is a new contributor. Be nice, and check out our Code of Conduct.
bc888 is a new contributor. Be nice, and check out our Code of Conduct.
bc888 is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Mathematica 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%2fmathematica.stackexchange.com%2fquestions%2f193136%2fbitnot-does-not-flip-bits-in-the-way-i-expected%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
3
$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
2 hours ago
$begingroup$
Is there a work around?
$endgroup$
– bc888
2 hours ago
$begingroup$
not any I know of.
$endgroup$
– kglr
2 hours ago
$begingroup$
BitNot should yield 221
$endgroup$
– bc888
2 hours ago
5
$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that
BitNot[n]is simply equivalent to-1-n."$endgroup$
– Chip Hurst
2 hours ago