OKlibrary
0.2.1.6

Plans for the module on factorisation of natural numbers. More...
Go to the source code of this file.
Plans for the module on factorisation of natural numbers.
Tools for finding factorisations n = a * b.
The next thing is to use a representation as an alliance of (strong) active clausesets, using the school method, but for an arbitrary basis b, which gives the domain size for the variables. In this way we can optimise on b.
(Strong) Active clausesets for addition and multiplication of digits seem most natural. A further parameter could be the number k of digits considered as one block (or should this be handled by using a larger b? seems so!).
The implementation of strong active clausesets likely utilises (large) tables, and possibly finite automata. From constraints a+b=c we might get equations, so we need them as literals; from constraints a*b=c we could also get for example a=c/b, and the question is whether we should handle also such functional dependencies.
Definition in file Factorisation.hpp.