Where 3 5 & offers 1
The bits in each place in the 1st quantity (chr) must match bits in each place when you look at the 2nd quantity. Here just the people in red.
One other place either have actually 0 and 0 equals 0 or 1 and 0 equals 0. However the final place has 1 and 1 equals 1.
Do you want more explanation – or would you simply instead skip it.
Did you run into this in another of ACES guages and wished to discover how it worked? Continue Reading →