Assertion: algebra's element | /r/HasProperty | idempotent
Facets:
Source sentences:
text: However, the ring of the integers modulo n has 2k idempotents, where k is the number of distinct prime factors of n. A commutative ring in which every element is equal to its square (every element is idempotent) is called a Boolean ring; an example from computer science is the ring whose elements are binary numbers, with bitwise AND as the multiplication operation and bitwise XOR as the addition operation.
text: An element of a ring that is equal to its own square is called an idempotent.