For instance by knowing that a = 1, b = 1 is a solution set for P = 11, it is possible to calculate that a = 3161, b = 7159 is a solution set for 11^8 power in just 3 iterations and to further find a solution for P = 11^9 in at most 5 iterations. It takes just one iteration to go from a solution set for going from a solution set for p^n to p^2n but may take 2 iterations for going from solution sets for p^A and p^B to p^(A+B) since it is possible to unknowingly pick a course that gives p^(A+B) where a and b are not coprime, in that case one can revert to a course that will assure a coprime solution set.

Due to a lack of response I am loosing interest in posting on these forums. Please see my further posts at my own forum on Fibonacci and Triangular numbers at https://groups.yahoo.com/group/Triangular_and_Fibonacci_Numbers Be careful to take into account that this link can be inavertently parsed by the forum software.