- #1

- 2

- 0

## Homework Statement

The count sequence is: 2,3,5,7,11,13,17,19,23,29,31...

## Homework Equations

If 31 is the highest number (N), then I found out I could use log base-2 of (N+1), or 5 D flip-flops

## The Attempt at a Solution

I wrote out (painstakingly) the present/next table for all 32 states...more than 1/2 of it is don't care...fun...

The next is basically it; solving for D0-D4. Each present/next has Q0-Q4 input/output respectively...the trouble at this point is setting up a K-map for so much data.

Is there an app for this? lol

Any help would greatly appreciated.