Does anyone here know about Karnaugh Maps?
ughrr i have this assignment to submit next week and i dunno a thing about it. i'll give/pay whatever it takes, can someone tell me the answers to the question below
ughrr i have this assignment to submit next week and i dunno a thing about it. i'll give/pay whatever it takes, can someone tell me the answers to the question below

A prime number is a number with no divisors except for itself and 1; the first
few primes are 1; 2; 3; 5; 7; 11; 13; 17; : : :. You will use a Karnaugh map to design
a digital circuit with a 4-bit input, representing an unsigned integer between 0
and 15, and with a 1-bit output, which will be true if the input is prime and
false otherwise.
1. Write a truth table for this circuit: the input variables should be x3; x2; x1; x0,
where x3 is the most signicant bit and x0 the least signicant
2. Draw a 4 4 Karnaugh map for the circuit.
3. Which rectangles of 1s can you nd in this map?
4. Using the map, write an optimised Boolean expression in the input vari-
ables
5. Translate the optimised Boolean expression into a circuit.




