title: Prime number detector between 0 and 101, digital logic karnaugh map
body: <p>For the input of 101, one needs to have 7 bits, but I dunno how to start drawing a k-map with 7 variables...</p>
  
  <p><a href="https://www.youtube.com/watch?v=OlxMev7l3ac" rel="nofollow">Here's</a> a tutorial on doing 5 variable k-map, and the SOP equation is:</p>
  
  <p>F = a' b' e + a' b' c' d + b c d' e + a c d e + b' c' e + a' c' d e</p>
  
  <p>Which I guess can be used in VHDL, you input some number, and F will output 1 if the number is prime (e.g. 7) or 0 if it's not. But this equation only supports number up to 31, how do I find an equation that'll cover prime numbers between 0 and 101??</p>
  
  <p>How would I start doing the k-map? Would my a input also be separate kind of like the in the youtube example?</p>