Question

In a shift left operation for example,

5 << 1 = 10

10 << 1 = 20

then a mathematical equation can be made,

n << 1 = n * 2.

If there is an equation for a shift left operation,

then is it possible that there is also a

mathematical equation for
an AND operation?

or any other bitwise operators?

Answer 1

There is no straightforward single operation that maps to every bitwise operation. However, they can all be simulated through iterative means (or one really long formula).

(a & b)

can be done with:

(((a/1 % 2) * (b/1 % 2)) * 1) +
(((a/2 % 2) * (b/2 % 2)) * 2) +
(((a/4 % 2) * (b/4 % 2)) * 4) +
...
(((a/n % 2) * (b/n % 2)) * n)

Where n is 2 to the number of bits that A and B are composed minus one. This assumes integer division (remainder is discarded).