How many complete pathways of choices are there?
How many choices are left to achieve completion [!]
Either offers an accurate divisor into the number of possibilities "n" roughly at whatever is the above determined level which is a power called "m". n^m, roughly...divided by either the # of pathways or the choices that are left [!] to completion.
Either divisor will serve by ridding us of duplicate iterations of over-multiplied possibilities inside of roughly n^m.
Put another way, simple estimations of "n" at the indicated power level do not recognize that
1) more than one path arrives to a conclusion;
Nor do simple estimations at indicated power levels recognize that
2) apparent particulars from which to work toward completion are actually not different particulars--half of them are double counted at the level of being two choices from complete due to the dimensionality of the whole becoming complete.
So the impact of having a divisor is strongest either when:
1) working toward completion from levels that already include almost all dimensions of particulars or else
2) whenever operating at low levels of power which have only a few pathways.
Estimations of possibilities are easily too high if not considering the adjustments for cases 1) and 2).
These are for occasions of having more than one possibility.
The number of complete outcomes that are reachable, divided by all choosable pathways = n/n = 1 .
Or else, any one outcome chosen from its penultimate particulars through to completeness = 1/1 = 1 .
Singular possibility is by definition, complete, whole, created, ultimate, and embraced in all of its dimensions. It is both one easily won and/or one, fully, dimensionally itself.
(Whatever is not and is not divided,
or, is nothing left unchosen
= truly naught and something not found = 0.)
Sources: Closed dimensional choice paths (the geometry of the powers depicted) and Pascal's Triangle