given that:
xnor abc = true if none or 2 of abc are true (even # true inputs = true output)
and
xor abc = true if 1 or all of abc are true (odd # true inputs = true output)
(...i think i have this right...)
Is there a (probably super complicated) chain of gates that will only ouput true if the # of true inputs is prime, given a ??? # of inputs?
(if it helps, I have functions handy that will alternatively give true/false output based on the difference between the truncation of 2 inputs, which I think can be fenangled into weeding out anything cleanly divisible by something other than itself and 1)...
