ComputeLimitDivideEtImpera​(AngouriMath.​Entity.​Variable,​AngouriMath.​Entity,​AngouriMath.​Core.​ApproachFrom)

https://en.wikipedia.org/wiki/Divide_and_rule Divide and rule (Latin: divide et impera), or divide and conquer,
in politics and sociology is gaining and maintaining power by
breaking up larger concentrations of power into pieces that
individually have less power than the one implementing the strategy.

In computer science, divide and conquer is an algorithm design paradigm
based on multi-branched recursion. A divide-and-conquer algorithm works
by recursively breaking down a problem into two or more sub-problems of
the same or related type, until these become simple enough to be solved
directly. The solutions to the sub-problems are then combined to give a
solution to the original problem.