Maximum XOR product
Given a, b and n, choose x with 0 <= x < 2^n to maximize (a XOR x) * (b XOR x), returned modulo a large prime. Explain the bit-by-bit greedy that keeps the two factors as close as possible. Only the title of this report was public; the details follow the common version.
MicrosoftOnline assessmentNo answer yet. Write the first one; the best answer gets endorsed.