gives the bitwise OR of the integers ni.
- Integer mathematical function, suitable for both symbolic and numerical manipulation.
- BitOr[n1,n2,…] yields the integer whose binary bit representation has ones at positions where the binary bit representations of any of the ni have ones.
- For negative integers BitOr assumes a two's complement representation.
- BitOr automatically threads over lists.
Examplesopen allclose all
Basic Examples (1)
BitOr takes any number of arguments:
Generalizations & Extensions (2)
Neat Examples (1)
Introduced in 1999