# Boolean Algrebra: Karnaugh Map [closed]

Using the Karnaugh map, express the following function:

F(0, 1, 4, 5, 8, 10, 11, 12, 13, 15)

-

## closed as off-topic by This is much healthier., Jonas Meyer, Daniel Rust, Hakim, glaceJul 4 at 0:31

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – This is much healthier., Jonas Meyer, Daniel Rust, Hakim, glace
If this question can be reworded to fit the rules in the help center, please edit the question.

This definitely appears to be homework - perhaps you're preparing for an exam. If it's for some coursework could you please mark it with the homework tag and indicate what you understand and what you've already tried. –  Glen_b Feb 21 '13 at 5:36
Do you want an expression in the bits $b_3$,$b_2$,$b_1$, and $b_0$ that's true exactly when the binary number $b_3b_2b_1b_0$ is in your list?
If so, this is what the Karnaugh Explorer here gives: \eqalign{&(b_1=0 \textrm{ and } b_0=0) \textrm{ or }\cr & (b_3=0 \textrm{ and } b_1=0) \textrm{ or }\cr & (b_2=1 \textrm{ and } b_1=0) \textrm{ or }\cr & (b_3=1 \textrm{ and } b_1=1 \textrm{ and } b_0=1) \textrm{ or }\cr & (b_3=1 \textrm{ and } b_2=0 \textrm{ and } b_1=1)\textrm{,}} if I didn't miscopy anything.