After much thinking I am trying to get a help from the board. Sorry for being naïve and thank you in advance for your answers.(adsbygoogle = window.adsbygoogle || []).push({});

Suppose you have to arrays made up of zeros and ones

a=(1,1,0,1,0,0)

b=(1,0,0,1,1,0)

and a logic relationship to compare the elements of the two arrays in a ordered way, for instance

a[0] & b[0] =true, a[1] & b[1] = true .... a[n] & b[n] = false

I would like to known a general formula to calculate the number of unique permutations of a having at least the same number of 'true' relationships as observed in the original comparison.

I know the number of the positions that became 'true' or 'false' when a '0' is replaced by a '1' or vice versa.

Best regards,

Riccardo

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Probability of logic relationships

**Physics Forums | Science Articles, Homework Help, Discussion**