## Description

Problem 7.1: quine-mccluskey algorithm (2+4+3+1 = 10 points)

Consider integer numbers in the range 0. . . 63 that can be represented using six bits. The boolean

function F(X5, X4, X3, X2, X1, X0) is true when the number (X5X4X3X2X1X0)2 is a Fibonacci

number and false otherwise.

a) Provide a boolean expression in DNF defining the function F. What is the cost of the DNF

expression?

b) Calculate the prime implicants of F.

c) Construct the prime implicant chart and identify the essential prime implicants. What is a

minimal set of prime implicants covering the function F?

d) Write out a minimal boolean expression defining F using mathematical logic notation. What is

the cost of the minimal boolean expression?

For calculating the cost of a boolean expression, we only consider logical ∧ and ∨ operations.