title: Truth table with 5 inputs and 3 outputs
body: <p>I have to make a truth table with 5 inputs and 3 outputs, something like this:</p>
  
  <p><code>A B C D E   red green blue<br>
  0 0 0 0 0    0    0    0<br>
  0 0 0 0 1    0    0    1<br>
  0 0 0 1 0    0    0    1
  .
  .
  .
  .
  1 1 0 1 0    0    1    1<br>
  .
  .
  .
  1 1 1 1 1    1    0     1</code></p>
  
  <p>etc. (in total 32 rows, the numbers in the rgb table represents the number of 1's in each row in binary i.e in row 1 1 0 1 0 there are three 1's, so three in binary is 0 1 1).  </p>
  
  <p>I would like to present the result of it in the Atanua (<a href="http://sol.gfxile.net/atanua/index.html" rel="nofollow noreferrer">http://sol.gfxile.net/atanua/index.html</a>) tool (so fore example when I press button E, the blue light will shine, when pressing A B D the green and blue light will shine and so on). But there is a requirement that I can only use AND, OR, NOT operands, and each operand can only have two inputs. Although I'm using Karnaugh map to minimize it, still for so many records the results for each output are very long (especially for the last one). </p>
  
  <p>I tried to simplify it more by adding all of the three output boolean functions into one, and the minimization process ended pretty well:</p>
  
  <p><code>A + B + C + D</code></p>
  
  <p>It seems to work fine (but as there is only one output light, it works only in red green blue column separately). My concern is the fact that I would like to have three outputs (three lights, not one), and is that even possible after this kind of minimization? Is there a good solution to do it in Atanua? Or do I have to make 3 separate boolean functions, no matter how long they will be (and there is a lot of them even after minimization)?</p>
  
  <p>EDIT: the whole truth table :)</p>
  
  <p><code>A B C D E R G B</code></p>
  
  <p><code>0 0 0 0 0 0 0 0</code><br>
  <code>0 0 0 0 1 0 0 1</code><br>
  <code>0 0 0 1 0 0 0 1</code><br>
  <code>0 0 0 1 1 0 1 0</code><br>
  <code>0 0 1 0 0 0 0 1</code><br>
  <code>0 0 1 0 1 0 1 0</code><br>
  <code>0 0 1 1 0 0 1 0</code><br>
  <code>0 0 1 1 1 0 1 1</code><br>
  <code>0 1 0 0 0 0 0 1</code><br>
  <code>0 1 0 0 1 0 1 0</code><br>
  <code>0 1 0 1 0 0 1 0</code><br>
  <code>0 1 0 1 1 0 1 1</code><br>
  <code>0 1 1 0 0 0 1 0</code><br>
  <code>0 1 1 0 1 0 1 1</code><br>
  <code>0 1 1 1 0 0 1 1</code><br>
  <code>0 1 1 1 1 1 0 0</code><br>
  <code>1 0 0 0 0 0 0 1</code><br>
  <code>1 0 0 0 1 0 1 0</code><br>
  <code>1 0 0 1 0 0 1 0</code><br>
  <code>1 0 0 1 1 0 1 1</code><br>
  <code>1 0 1 0 0 0 1 0</code><br>
  <code>1 0 1 0 1 0 1 1</code><br>
  <code>1 0 1 1 0 0 1 1</code><br>
  <code>1 0 1 1 1 1 0 0</code><br>
  <code>1 1 0 0 0 0 1 0</code><br>
  <code>1 1 0 0 1 0 1 1</code><br>
  <code>1 1 0 1 0 0 1 1</code><br>
  <code>1 1 0 1 1 1 0 0</code><br>
  <code>1 1 1 0 0 0 1 1</code><br>
  <code>1 1 1 0 1 1 0 0</code><br>
  <code>1 1 1 1 0 1 0 0</code><br>
  <code>1 1 1 1 1 1 0 1</code><br>
  And the karnaugh map for each color (~is the gate NOT, * is AND, + OR):<br>
  RED:<br>
  BCDE+ACDE+ABDE+ABCE+ABCD<br>
  GREEN:<br>
  ~A~BDE+~AC~DE+~ACD~E+~BCD~E+~AB~CE+B~CD~E+BC~D~E+A~B~CE+A~B~CD+A~BC~D+AB~C~D  </p>
  
  <p>BLUE:<br>
  ~A~B~C~DE+~A~B~CD~E+~A~BC~D~E+~A~BCDE+~AB~C~D~E+~AB~CDE+~ABC~DE+~ABCD~E+A~B~C~D~E+A~B~CDE+A~BC~DE+A~BCD~E+AB~C~DE+AB~CD~E+ABC~D~E+ABCDE</p>