Designing a prime-number counter (up to 31)?

  • Thread starter EvilSpock
  • Start date
  • #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.
 

Answers and Replies

Related Threads on Designing a prime-number counter (up to 31)?

  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
4
Views
14K
  • Last Post
Replies
11
Views
16K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
2
Views
1K
Replies
33
Views
1K
  • Last Post
Replies
8
Views
4K
  • Last Post
2
Replies
39
Views
2K
  • Last Post
Replies
4
Views
898
  • Last Post
Replies
5
Views
3K
Top