Every non-unit element of N, Z, Z[i], Z[ω], and Z[√2] is shown to be the sum-product of some non-trivial minimal multiset, with the lunar-arithmetic section containing a false lemma and false example.
An Algorithm to Solve the Equal-Sum-Product Problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.RA 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bioperational Multisets in Various Semi-rings
Every non-unit element of N, Z, Z[i], Z[ω], and Z[√2] is shown to be the sum-product of some non-trivial minimal multiset, with the lunar-arithmetic section containing a false lemma and false example.