Summary: A hierarchical parallel algorithm is presented, that is useful in discovering identities involving factorizations. The algorithm has principally been applied to Fibonacci-Lucas identities. The algorithm has good modularity, concurrency, scalability and locality and resembles the adaptive systems modeled with Uttley’s informon networks. The algorithm is based on a topology on the space of examples and generalizations that models the process of pattern recognition.