Nimber multiplication #
The nim product a * b
is recursively defined as the least nimber not equal to any
a' * b + a * b' + a' * b'
for a' < a
and b' < b
. When endowed with this operation, the nimbers
form a field.
Todo #
- Define nim division and prove nimbers are a field.
- Show the nimbers are algebraically closed.
Nimber multiplication #
@[irreducible]
Nimber multiplication is recursively defined so that a * b
is the smallest nimber not equal to
a' * b + a * b' + a' * b'
for a' < a
and b' < b
.
Equations
Instances For
Equations
Equations
- Nimber.instCancelMonoidWithZero = CancelMonoidWithZero.mk