To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Amenable number

From Wikipedia, the free encyclopedia

An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number. To put it algebraically, for a positive integer n, there is a multiset of n integers {a1, ..., an}, for which the equalities

hold. Negative numbers are allowed in the multiset. For example, 5 is amenable since 5 = 1 + (-1) + 1 + (-1) + 5. All and only those numbers congruent to 0 or 1 (mod 4), except 4, are amenable. (Tamvakis & Lossers 1998)

The first few amenable numbers are: 1, 5, 8, 9, 12, 13 ... OEISA100832

A solution for integers of the form n = 4k + 1 could be given by a set of 2k (+1)s and 2k (-1)s and n itself. (This generalizes the example of 5 given above.)

Although not obvious from the definition, the set of amenable numbers is closed under multiplication (the product of two amenable numbers is an amenable number).

All composite numbers would be amenable if the multiset was allowed to be of any length, because, even if other solutions are available, one can always obtain a solution by taking the prime factorization (expressed with repeated factors rather than exponents) and add as many 1s as necessary to add up to n. The product of this set of integers will yield n no matter how many 1s there are in the set. Furthermore, still under this assumption, any integer n would be amenable. Consider the inelegant solution for n of {1, -1, 1, -1, n}. In the sum, the positive ones are cancelled out by the negative ones, leaving n, while in the product, the two negative ones cancel out the effect of their signs.

Amenable numbers should not be confused with amicable numbers, which are pairs of integers whose divisors add up to each other.

YouTube Encyclopedic

  • 1/1
    Views:
    347
  • Absolute (Global) Extrema

Transcription

References

  • Mathworld entry on Amenable Numbers
  • Sloane, N. J. A. (ed.). "Sequence A100832 (Amenable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • Tamvakis, H. (1995), "Problem 10454", American Mathematical Monthly, 102: 463, doi:10.2307/2975042
  • Tamvakis, H.; Lossers, O.P. (1998), "Solution to Problem 10454. Amenable Numbers", American Mathematical Monthly, 105: 368, doi:10.2307/2589724
This page was last edited on 12 August 2022, at 16:31
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.