← Complete problem index

PROJECT EULER · #0813

XOR-Powers

Statement only · UnsolvedOriginal problem ↗

We use x⊕y to be 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, 11⊗11=69, or in base 2, 10112⊗10112=10001012:

⊗111110112⊗111110112⊗111110112⊗111101129⊕110112999⊗1110001012 Further we define P(n)=11⊗n=11⊗11⊗…⊗11⏞n. For example P(2)=69.

Find P(812⋅128). Give your answer modulo 109+7.

Write-up coming later

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