Note:  you may work in teams on this assignment, but if you do, you must indicate so on each student's assignment (see Course Ethics for more information).

Also note:  By popular demand, assignments will now be due at the start of class, rather than start of school day.  However, you may not work on your assignments during class.
 

Date Assigned:	Fri Sep-8
Date Due:	Mon Sep-11 by start of class

Referring the the Chapter Review Problems in Brookshear on pp. 70-72:
1.  Do the following problems from these pages:
    1b, 1c, 2b, 2c, 3b, 3c, 13, 16.

2.  Extra Credit:  Read ahead about binary numbers.  You will see that with 3 bits we can represent the decimal numbers 0 through 7, as the following table shows:
 

x	y	z	3-bit binary number (xyz)	Decimal equivalent
0	0	0	000	0
0	0	1	001	1
0	1	0	010	2
0	1	1	011	3
1	0	0	100	4
1	0	1	101	5
1	1	0	110	6
1	1	1	111	7

Your task is to write a circuit which checks for prime numbers.  That is, your circuit should take 3 inputs -- x, y, and z -- which represent the 3-bit binary number xyz in the table above, and it should produce one output which is true if that number is prime (that is, if its decimal equivalent is 2, or 3, or 5, or 7).

See Course Home Page.