In mathematics and computer science, the BIT predicate, sometimes written BIT ( i , j ) {\displaystyle {\text{BIT}}(i,j)} , is a predicate that tests whether the j {\displaystyle j} th bit of the number i {\displaystyle i} (starting from the least significant bit) is 1, when i {\displaystyle i} is written as a binary number. Its mathematical applications include modeling the membership relation of hereditarily finite sets, and defining the adjacency relation of the Rado graph.
In mathematics and computer science, the BIT predicate, sometimes written BIT ( i , j ) {\displaystyle {\text{BIT}}(i,j)} , is a predicate that tests whether the j {\displaystyle j} th bit of the number i {\displaystyle i} (starting from the least significant bit) is 1, when i {\displaystyle i} is written as a binary number. Its mathematical applications include modeling the membership relation of hereditarily finite sets, and defining the adjacency relation of the Rado graph.
Source: Wikipedia "BIT predicate" · CC BY-SA 4.0
Share this article: X · Bluesky