For finite nimbers, multiplication is recursively defined from smaller arguments by
where is Nim-sum and mex selects the smallest missing nonnegative integer. Thus zero times anything is zero and one times is . For , the displayed set is , so .
Together with Nim-sum, this is field arithmetic on finite nimbers, rather than ordinary integer multiplication. In particular cannot be computed by a usual integer product or bitwise exclusive or.[ref]

Articles by others on the same topic (0)

There are currently no matching articles.