An amenable number is an integer for which there exists a multiset of at least two positive integers that can be either added up or multiplied together to give the original number. To put it algebraically, for an integer , there is a set of integers , for which the equalities
hold. An elegant example is the number 6, which is an amenable number since .
All composite numbers are amenable because, even if other solutions are available, one can always make an inelegant solution by taking the prime factorization (expressed with repeated factors rather than exponents) and add as many 1s as necessary to add up to . Because of the multiplicative identity, multiplying this set of integers will yield no matter how many 1s there are in the set.
If we allow negative integers in the set, then all prime numbers are also amenable. Even if no other solutions are available, one can always make an inelegant solution for a prime number of . In the sum, the two positive ones are cancelled out by the two negative ones, leaving , while in the product, the two negative ones cancel out the effect of their signs, leaving only the multiplicative identity to affect the final result.
|Date of creation||2013-03-22 16:37:02|
|Last modified on||2013-03-22 16:37:02|
|Last modified by||PrimeFan (13766)|