# What is idempotent law in Boolean algebra?

**What is idempotent law in Boolean algebra?**In

**pmixi**

The **idempotent law** states that x OR x is x and x AND x is x. The theorems of **boolean algebra** can be proved using Huntington postulates. Each postulate and **theorem** of **boolean algebra** has two parts; one is dual of another. If one part is proved the other one can be proved using duality principle.

.

Thereof, what is idempotent law?

**Idempotent Law**. **Idempotence** is the property of certain operations in mathematics and computer science that they can be applied multiple times without changing the result beyond the initial application. Both 0 and 1 are **idempotent** under multiplication, because 0 x 0 = 0 and 1 x 1 = 1.

Also Know, how do you prove associative law in Boolean algebra? **Proof**: If A, B and C are three variables, then the grouping of 3 variables with 2 variables in each set will be of 3 types, such as (A + B), (B + C) and(C + A). According to **associative law**, we need to **prove** that x = y.

Also question is, what are the laws of Boolean algebra?

The basic **Laws of Boolean Algebra** that relate to the Commutative **Law** allowing a change in position for addition and multiplication, the Associative **Law** allowing the removal of brackets for addition and multiplication, as well as the Distributive **Law** allowing the factoring of an expression, are the same as in ordinary

How do you calculate Boolean algebra?

The **formula** A+B+C+D will yield true (1) if at least one of A,B,C,D is 1. The **formula** A./B.C will be true only if A=1, B=0 (so /B=1) and C=1. **Boolean algebra** knows two distributive laws with operations AND and OR.

**Trending Answer**