Промежуточные таблицы истинности:C∧B:
(C∧B)∧V:
| C | B | V | C∧B | (C∧B)∧V |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 1 |
((C∧B)∧V)∧(C∧B):
| C | B | V | C∧B | (C∧B)∧V | C∧B | ((C∧B)∧V)∧(C∧B) |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 |
(((C∧B)∧V)∧(C∧B))∧A:
| C | B | V | A | C∧B | (C∧B)∧V | C∧B | ((C∧B)∧V)∧(C∧B) | (((C∧B)∧V)∧(C∧B))∧A |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
F≡((((C∧B)∧V)∧(C∧B))∧A):
| F | C | B | V | A | C∧B | (C∧B)∧V | C∧B | ((C∧B)∧V)∧(C∧B) | (((C∧B)∧V)∧(C∧B))∧A | F≡((((C∧B)∧V)∧(C∧B))∧A) |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Общая таблица истинности:
| F | C | B | V | A | C∧B | (C∧B)∧V | ((C∧B)∧V)∧(C∧B) | (((C∧B)∧V)∧(C∧B))∧A | F≡((C∧B)∧V∧(C∧B))∧A |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Совершенная дизъюнктивная нормальная форма (СДНФ):
По таблице истинности:
| F | C | B | V | A | F |
| 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 |
| 1 | 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 |
F
сднф = ¬F∧¬C∧¬B∧¬V∧¬A ∨ ¬F∧¬C∧¬B∧¬V∧A ∨ ¬F∧¬C∧¬B∧V∧¬A ∨ ¬F∧¬C∧¬B∧V∧A ∨ ¬F∧¬C∧B∧¬V∧¬A ∨ ¬F∧¬C∧B∧¬V∧A ∨ ¬F∧¬C∧B∧V∧¬A ∨ ¬F∧¬C∧B∧V∧A ∨ ¬F∧C∧¬B∧¬V∧¬A ∨ ¬F∧C∧¬B∧¬V∧A ∨ ¬F∧C∧¬B∧V∧¬A ∨ ¬F∧C∧¬B∧V∧A ∨ ¬F∧C∧B∧¬V∧¬A ∨ ¬F∧C∧B∧¬V∧A ∨ ¬F∧C∧B∧V∧¬A ∨ F∧C∧B∧V∧A
Логическая cхема:
Совершенная конъюнктивная нормальная форма (СКНФ):
По таблице истинности:
| F | C | B | V | A | F |
| 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 |
| 1 | 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 |
F
скнф = (F∨¬C∨¬B∨¬V∨¬A) ∧ (¬F∨C∨B∨V∨A) ∧ (¬F∨C∨B∨V∨¬A) ∧ (¬F∨C∨B∨¬V∨A) ∧ (¬F∨C∨B∨¬V∨¬A) ∧ (¬F∨C∨¬B∨V∨A) ∧ (¬F∨C∨¬B∨V∨¬A) ∧ (¬F∨C∨¬B∨¬V∨A) ∧ (¬F∨C∨¬B∨¬V∨¬A) ∧ (¬F∨¬C∨B∨V∨A) ∧ (¬F∨¬C∨B∨V∨¬A) ∧ (¬F∨¬C∨B∨¬V∨A) ∧ (¬F∨¬C∨B∨¬V∨¬A) ∧ (¬F∨¬C∨¬B∨V∨A) ∧ (¬F∨¬C∨¬B∨V∨¬A) ∧ (¬F∨¬C∨¬B∨¬V∨A)
Логическая cхема:
Построение полинома Жегалкина:
По таблице истинности функции
| F | C | B | V | A | Fж |
| 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 |
| 1 | 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 |
Построим полином Жегалкина:
F
ж = C
00000 ⊕ C
10000∧F ⊕ C
01000∧C ⊕ C
00100∧B ⊕ C
00010∧V ⊕ C
00001∧A ⊕ C
11000∧F∧C ⊕ C
10100∧F∧B ⊕ C
10010∧F∧V ⊕ C
10001∧F∧A ⊕ C
01100∧C∧B ⊕ C
01010∧C∧V ⊕ C
01001∧C∧A ⊕ C
00110∧B∧V ⊕ C
00101∧B∧A ⊕ C
00011∧V∧A ⊕ C
11100∧F∧C∧B ⊕ C
11010∧F∧C∧V ⊕ C
11001∧F∧C∧A ⊕ C
10110∧F∧B∧V ⊕ C
10101∧F∧B∧A ⊕ C
10011∧F∧V∧A ⊕ C
01110∧C∧B∧V ⊕ C
01101∧C∧B∧A ⊕ C
01011∧C∧V∧A ⊕ C
00111∧B∧V∧A ⊕ C
11110∧F∧C∧B∧V ⊕ C
11101∧F∧C∧B∧A ⊕ C
11011∧F∧C∧V∧A ⊕ C
10111∧F∧B∧V∧A ⊕ C
01111∧C∧B∧V∧A ⊕ C
11111∧F∧C∧B∧V∧A
Так как F
ж(00000) = 1, то С
00000 = 1.
Далее подставляем все остальные наборы в порядке возрастания числа единиц, подставляя вновь полученные значения в следующие формулы:
F
ж(10000) = С
00000 ⊕ С
10000 = 0 => С
10000 = 1 ⊕ 0 = 1
F
ж(01000) = С
00000 ⊕ С
01000 = 1 => С
01000 = 1 ⊕ 1 = 0
F
ж(00100) = С
00000 ⊕ С
00100 = 1 => С
00100 = 1 ⊕ 1 = 0
F
ж(00010) = С
00000 ⊕ С
00010 = 1 => С
00010 = 1 ⊕ 1 = 0
F
ж(00001) = С
00000 ⊕ С
00001 = 1 => С
00001 = 1 ⊕ 1 = 0
F
ж(11000) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
11000 = 0 => С
11000 = 1 ⊕ 1 ⊕ 0 ⊕ 0 = 0
F
ж(10100) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
10100 = 0 => С
10100 = 1 ⊕ 1 ⊕ 0 ⊕ 0 = 0
F
ж(10010) = С
00000 ⊕ С
10000 ⊕ С
00010 ⊕ С
10010 = 0 => С
10010 = 1 ⊕ 1 ⊕ 0 ⊕ 0 = 0
F
ж(10001) = С
00000 ⊕ С
10000 ⊕ С
00001 ⊕ С
10001 = 0 => С
10001 = 1 ⊕ 1 ⊕ 0 ⊕ 0 = 0
F
ж(01100) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
01100 = 1 => С
01100 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(01010) = С
00000 ⊕ С
01000 ⊕ С
00010 ⊕ С
01010 = 1 => С
01010 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(01001) = С
00000 ⊕ С
01000 ⊕ С
00001 ⊕ С
01001 = 1 => С
01001 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(00110) = С
00000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00110 = 1 => С
00110 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(00101) = С
00000 ⊕ С
00100 ⊕ С
00001 ⊕ С
00101 = 1 => С
00101 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(00011) = С
00000 ⊕ С
00010 ⊕ С
00001 ⊕ С
00011 = 1 => С
00011 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(11100) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
11000 ⊕ С
10100 ⊕ С
01100 ⊕ С
11100 = 0 => С
11100 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11010) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00010 ⊕ С
11000 ⊕ С
10010 ⊕ С
01010 ⊕ С
11010 = 0 => С
11010 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11001) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00001 ⊕ С
11000 ⊕ С
10001 ⊕ С
01001 ⊕ С
11001 = 0 => С
11001 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10110) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00010 ⊕ С
10100 ⊕ С
10010 ⊕ С
00110 ⊕ С
10110 = 0 => С
10110 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10101) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00001 ⊕ С
10100 ⊕ С
10001 ⊕ С
00101 ⊕ С
10101 = 0 => С
10101 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10011) = С
00000 ⊕ С
10000 ⊕ С
00010 ⊕ С
00001 ⊕ С
10010 ⊕ С
10001 ⊕ С
00011 ⊕ С
10011 = 0 => С
10011 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(01110) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
01100 ⊕ С
01010 ⊕ С
00110 ⊕ С
01110 = 1 => С
01110 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(01101) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00001 ⊕ С
01100 ⊕ С
01001 ⊕ С
00101 ⊕ С
01101 = 1 => С
01101 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(01011) = С
00000 ⊕ С
01000 ⊕ С
00010 ⊕ С
00001 ⊕ С
01010 ⊕ С
01001 ⊕ С
00011 ⊕ С
01011 = 1 => С
01011 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(00111) = С
00000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
00111 = 1 => С
00111 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(11110) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
11000 ⊕ С
10100 ⊕ С
10010 ⊕ С
01100 ⊕ С
01010 ⊕ С
00110 ⊕ С
11100 ⊕ С
11010 ⊕ С
10110 ⊕ С
01110 ⊕ С
11110 = 0 => С
11110 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11101) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00001 ⊕ С
11000 ⊕ С
10100 ⊕ С
10001 ⊕ С
01100 ⊕ С
01001 ⊕ С
00101 ⊕ С
11100 ⊕ С
11001 ⊕ С
10101 ⊕ С
01101 ⊕ С
11101 = 0 => С
11101 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11011) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00010 ⊕ С
00001 ⊕ С
11000 ⊕ С
10010 ⊕ С
10001 ⊕ С
01010 ⊕ С
01001 ⊕ С
00011 ⊕ С
11010 ⊕ С
11001 ⊕ С
10011 ⊕ С
01011 ⊕ С
11011 = 0 => С
11011 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10111) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
10100 ⊕ С
10010 ⊕ С
10001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
10110 ⊕ С
10101 ⊕ С
10011 ⊕ С
00111 ⊕ С
10111 = 0 => С
10111 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(01111) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
01100 ⊕ С
01010 ⊕ С
01001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
01110 ⊕ С
01101 ⊕ С
01011 ⊕ С
00111 ⊕ С
01111 = 0 => С
01111 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 1
F
ж(11111) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
11000 ⊕ С
10100 ⊕ С
10010 ⊕ С
10001 ⊕ С
01100 ⊕ С
01010 ⊕ С
01001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
11100 ⊕ С
11010 ⊕ С
11001 ⊕ С
10110 ⊕ С
10101 ⊕ С
10011 ⊕ С
01110 ⊕ С
01101 ⊕ С
01011 ⊕ С
00111 ⊕ С
11110 ⊕ С
11101 ⊕ С
11011 ⊕ С
10111 ⊕ С
01111 ⊕ С
11111 = 1 => С
11111 = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 = 0
Таким образом, полином Жегалкина будет равен:
F
ж = 1 ⊕ F ⊕ C∧B∧V∧A
Логическая схема, соответствующая полиному Жегалкина:
