Question
Let n be a positive integer. For X {0, . . . , 2^n 1}, let Y denote the integer obtained by inverting the bits
Let n be a positive integer. For X {0, . . . , 2^n 1}, let Y denote the integer obtained by inverting the bits in the n-bit, binary representation of X (note that Y {0, . . . , 2n 1}).
Show that Y + 1 -X (mod 2^n). This justifies the usual rule for computing negatives in 2s complement arithmetic.
Hint: what is X + Y ?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Machine Learning And Knowledge Discovery In Databases Applied Data Science Track European Conference Ecml Pkdd 2021 Bilbao Spain September 13 17 2021 Proceedings Part 4 Lnai 12978
Authors: Yuxiao Dong ,Nicolas Kourtellis ,Barbara Hammer ,Jose A. Lozano
1st Edition
3030865134, 978-3030865139
