Proving boolean equivalence formula
up vote
0
down vote
favorite
$$
xoplus18 = ((x lor neg44) land (x oplus 62)) + (x land 44)
$$
whereas $(land, lor, oplus)$ correspond to bitwise operations over Boolean algebra ($B^n, land , lor, neg)$ and arithmetic operations are in integer modular ring $Z/(2^n)$.
and I want to know how prove this formula.
modular-arithmetic boolean-algebra
asked Nov 11 at 14:14
ooo0o
12
add a comment |
up vote
0
down vote
favorite
$$
xoplus18 = ((x lor neg44) land (x oplus 62)) + (x land 44)
$$
whereas $(land, lor, oplus)$ correspond to bitwise operations over Boolean algebra ($B^n, land , lor, neg)$ and arithmetic operations are in integer modular ring $Z/(2^n)$.
and I want to know how prove this formula.
modular-arithmetic boolean-algebra
asked Nov 11 at 14:14
ooo0o
12
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
$$
xoplus18 = ((x lor neg44) land (x oplus 62)) + (x land 44)
$$
whereas $(land, lor, oplus)$ correspond to bitwise operations over Boolean algebra ($B^n, land , lor, neg)$ and arithmetic operations are in integer modular ring $Z/(2^n)$.
and I want to know how prove this formula.
modular-arithmetic boolean-algebra
asked Nov 11 at 14:14
ooo0o
12
$$
xoplus18 = ((x lor neg44) land (x oplus 62)) + (x land 44)
$$
whereas $(land, lor, oplus)$ correspond to bitwise operations over Boolean algebra ($B^n, land , lor, neg)$ and arithmetic operations are in integer modular ring $Z/(2^n)$.
and I want to know how prove this formula.
modular-arithmetic boolean-algebra
modular-arithmetic boolean-algebra
asked Nov 11 at 14:14
ooo0o
12
asked Nov 11 at 14:14
ooo0o
12
edited Nov 21 at 10:50
asked Nov 11 at 14:14
ooo0o
12
asked Nov 11 at 14:14
ooo0o
12
asked Nov 11 at 14:14
ooo0o
12
12
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f2993933%2fproving-boolean-equivalence-formula%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
