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. ...
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. ...
Top 50 recent answers are included
Related Tags
boolean-algebra × 255logic × 55
complexity-theory × 30
satisfiability × 24
circuits × 24
algorithms × 22
digital-circuits × 19
propositional-logic × 15
karnaugh-map × 14
arithmetic × 9
optimization × 6
machine-learning × 6
3-sat × 6
graphs × 5
computer-architecture × 5
discrete-mathematics × 5
linear-algebra × 5
polynomials × 5
turing-machines × 4
np-complete × 4
computation-models × 4
learning-theory × 4
xor × 4
time-complexity × 3
finite-automata × 3