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.


open allclose all

Basic Examples  (1)

Scope  (3)

Use numbers of any size:

BitOr takes any number of arguments:

Use negative numbers:

Generalizations & Extensions  (2)

Basic symbolic simplifications are done automatically:

-1 corresponds to having all bits on:

Applications  (2)

Make a nested pattern:

Properties & Relations  (2)

Truth table for Or:

BitOr is Orderless:

Neat Examples  (1)

Introduced in 1999