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

[EvilSpock]

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.

 

[KataKoniK]

Hello there,

I understand your frustration with trying to solve this problem. It can be challenging to work with large amounts of data, especially when trying to set up a K-map. However, there are a few things you can do to make this process easier.

First, I would suggest breaking down the problem into smaller chunks. Instead of trying to solve for all 32 states at once, start with a smaller subset, such as the first 8 states. This will make it easier to set up a K-map and find a solution.

Secondly, there are several online tools and apps that can help with solving K-maps. One example is the "Karnaugh Map Solver" app, which allows you to enter your data and automatically generates a K-map for you. This can save you a lot of time and effort.

Lastly, don't hesitate to reach out to other scientists or colleagues for help. Collaboration and brainstorming can often lead to new insights and solutions.

I hope this helps and good luck with your problem!