New answers tagged boolean-algebra
1
vote
Combinational logic check if bits is prime
Of course, the circuit will just grow rapidly. For 8 bits there is no problem.
You check whether bit 0 is 0 or 1. If it is 0, then you check whether the input is 2.
If it is 1, then you check bit 7. ...
- 25.2k
3
votes
Combinational logic check if bits is prime
There is no known regularity in the primes, and for small numbers (such as 8 bits naturals), the best is to implement them as a table.
If you want an instant answer, one comparator per prime can do. ...
- 3,912
Top 50 recent answers are included