Consider any 2 binary numbers, e.g.: 10101011 ; 11111101 and their product, say P.
"Reverse" (mirror image) all the digits of the 2 numbers, e.g.: 11010101 ; 10111111
and consider their product, say M.
Question
Is there any simple math relation between P and M ? Can I get M only knowing P ?
PS. Please assume:
The numbers always start and end with 1.
The numbers have the same number of digits
or, even better, in any case the lengths of those 2 numbers are *known*
(Thank you to user2566092 for asking about possible constraints)
PS. Another interesting condition, suggested by the notes of Steve Kass, might be that P is a semiprime.
I will assume both numbers have the same length. If $A=a_n2^n+a_{n-1}2^{n-1}+\cdots +a_0$, $B=b_n2^n+b_{n-1}2^{n-1}+\cdots +b_0$ then $$A\times B=(a_0b_0)+(a_0b_1+a_1b_0)2+\cdots (a_nb_n)2^{2n}$$ The product of the reversals would be $$A_R\times B_R=(a_nb_n)+(a_nb_{n-1}+a_{n-1}b_n)2+\cdots (a_0b_0)2^{2n}$$ In other words, don't carry while multiplying. Then P and M will be reversals of each other. Otherwise, the counterexample given in the comments seems to show that no function of P will yield M.