An example of three concurring chainings for the computation of A^{15}
The base of the display is a table, where for each n (here n=2..15) the possible additive compositions of two terms are shown. The optimal chained composition must then visually be found by the optimal path through the row associated to the number n down to 1.
Example: begin at row 15; then it seems beneficious to look for trajectories over compositions of equal numbers and to organize the trajectories such that in the best way the compositions use always already computed values.
6 steps required; the "classical" binary squaring formula 
5 steps required

5 steps required
