Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Discrete Mathematics > Boolean Computation > Bitwise Operations > BitXor >
Mathematica > Mathematics and Algorithms > Logic & Boolean Algebra > Boolean Computation > Bitwise Operations > BitXor >
Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Programming > Boolean Computation > Bitwise Operations > BitXor >
BUILT-IN MATHEMATICA SYMBOLTutorials »|See Also »|More About »

BitXor

BitXor
gives the bitwise XOR of the integers .
MORE INFORMATION
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
  • BitXor yields the integer whose binary bit representation has ones at positions where an odd number of the binary bit representations of the have ones.
  • For negative integers BitXor assumes a two's complement representation.
  • BitXor automatically threads over lists.
EXAMPLESCLOSE ALL
Basic Examples   (1)
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Scope   (3)
Use numbers of any size:
BitXor takes any number of arguments:
Use negative numbers:
Generalizations & Extensions   (1)
Basic symbolic simplifications are done automatically:
Applications   (4)
Make a nested pattern:
Generate a Gray code sequence :
Bitwise version of rule 60 cellular automaton:
Properties & Relations   (4)
Truth table for Xor:
Even numbers of identical arguments give 0:
Neat Examples   (3)
"Munching squares" :
New in 4
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF