Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Amenable number
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Type of positive integer}} 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 {''a''<sub>1</sub>, ..., ''a<sub>n</sub>''}, for which the equalities <math display="block"> n = \sum_{i=1}^n a_i = \prod_{i=1}^n a_i</math> 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. {{harv|Tamvakis|Lossers|1998}} The first few amenable numbers are: 1, 5, 8, 9, 12, 13 ... {{OEIS2C|A100832}} A solution for integers of the form ''n'' = 4''k'' + 1 could be given by a set of 2''k'' (+1)s and 2''k'' (β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 number]]s 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 {{nowrap|1={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 number]]s, which are pairs of integers whose divisors add up to each other. == References == * [http://mathworld.wolfram.com/AmenableNumber.html Mathworld entry on Amenable Numbers] * {{Cite OEIS|sequencenumber=A100832|name=Amenable numbers}} * {{citation|last=Tamvakis|first=H.|title=Problem 10454|journal=[[American Mathematical Monthly]]|volume=102|page=463|year=1995|doi=10.2307/2975042 }} * {{citation|first1=H.|last1=Tamvakis|first2=O.P.|last2=Lossers|title=Solution to Problem 10454. Amenable Numbers|journal=[[American Mathematical Monthly]]|volume=105|year=1998|page=368|doi=10.2307/2589724}} {{numtheory-stub}} {{Classes of natural numbers}} [[Category:Number theory]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Citation
(
edit
)
Template:Cite OEIS
(
edit
)
Template:Classes of natural numbers
(
edit
)
Template:Harv
(
edit
)
Template:Nowrap
(
edit
)
Template:Numtheory-stub
(
edit
)
Template:OEIS2C
(
edit
)
Template:Short description
(
edit
)