← Complete problem index

PROJECT EULER · #0945

XOR-Equation C

Statement only · UnsolvedOriginal problem ↗
We use x⊕y for the bitwise XOR of x and y.
Define the XOR-product of x and y, denoted by x⊗y, similar to a long multiplication in base 2, except that the intermediate results are XORed instead of the usual integer addition.
For example, 7⊗3=9, or in base 2, 1112⊗112=10012:
⊗1111112⊗1111112⊗1111112⊕1111129⊗1110012
We consider the equation:
(a⊗a)⊕(2⊗a⊗b)⊕(b⊗b)=c⊗c

For example, (a,b,c)=(1,2,1) is a solution to this equation, and so is (1,8,13).

Let F(N) be the number of solutions to this equation satisfying 0≤a≤b≤N. You are given F(10)=21.

Find F(107).

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.