An Algorithm to Solve the Equal-Sum-Product Problem
Discrete Mathematics
2013-11-18 v1 Combinatorics
Abstract
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their product. An examination of the use of Binary Search Trees in implementing the algorithm into a working program is given. In addition an application of the algorithm for searching possible extra exceptional values of the equal-sum-product problem is explored after demonstrating a link between these numbers and the Sophie Germain primes.
Cite
@article{arxiv.1311.3874,
title = {An Algorithm to Solve the Equal-Sum-Product Problem},
author = {M. A. Nyblom and C. D. Evans},
journal= {arXiv preprint arXiv:1311.3874},
year = {2013}
}