(Redirected from Additive identity)
There are no approved revisions of this page, so it may
not have been
reviewed.
This article needs more work.
Please help by expanding it!
Addition is the act of adding up two quantities. Addition is the core binary operation of arithmetic. All other arithmetic operations can be defined, directly or indirectly, in terms of addition: subtraction is addition with additive inverse of second term (the subtrahend,) multiplication with an integer multiplier is repetitive addition (a 2nd iteration "hyper-addition",) division is multiplication with multiplicative inverse of second term (the divisor,) exponentiation with an integer exponent is repetitive multiplication (a 3rd iteration "hyper-addition",) root extraction is exponentiation with multiplicative inverse of second term, etc.
Addition with an integer addend is repetitive successor operation (a 2 nd iteration "hyper-succession"): a given number is repeatedly incremented a number of times ; this can be notated and read " plus ." For example, . In most computer programming languages, and in TeX source, the plus character + is used as the addition operator: m+n. Addition is commutative. Thus, .
Addition table
A003056 n appears n+1 times. Also table T(n,k)=n+k read by antidiagonals.
- {0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, ...}
Iterated addition
Iterated addition, can be abbreviated by the use of the summation operator (denoted with the capital letter sigma of the Greek alphabet), i.e.
Additive identity
The additive identity is 0.
Additive inverse
The additive inverse (denoted ) of is defined by
Subtraction is addition with additive inverse of second term (the subtrahend,) which by definition makes it non-commutative.
See also
Hierarchical list of operations pertaining to numbers [1] [2]
0th iteration
1st iteration
- Addition:
S(S(⋯ "a times" ⋯ (S(n)))) |
, the sum , where is the augend and is the addend. (When addition is commutative both are simply called terms.)
- Subtraction:
P(P(⋯ "s times" ⋯ (P(n)))) |
, the difference , where is the minuend and is the subtrahend.
2nd iteration
- Multiplication:
n + (n + (⋯ "k times" ⋯ (n + (n)))) |
, the product , where is the multiplicand and is the multiplier.[3] (When multiplication is commutative both are simply called factors.)
- Division: the ratio , where is the dividend and is the divisor.
3rd iteration
- Exponentiation ( as "degree", as "base", as "variable").
- Powers:
n ⋅ (n ⋅ (⋯ "d times" ⋯ (n ⋅ (n)))) |
, written .
- Exponentials:
b ⋅ (b ⋅ (⋯ "n times" ⋯ (b ⋅ (b)))) |
, written .
- Exponentiation inverses ( as "degree", as "base", as "variable").
4th iteration
- Tetration ( as "degree", as "base", as "variable").
- Tetration inverses ( as "degree", as "base", as "variable").
5th iteration
- Pentation ( as "degree", as "base", as "variable").
- Pentation inverses
6th iteration
- Hexation ( as "degree", as "base", as "variable").
- Hexation inverses
7th iteration
- Heptation ( as "degree", as "base", as "variable").
- Heptation inverses
8th iteration
- Octation ( as "degree", as "base", as "variable").
- Octa-powers:
n ^^^^^ (n ^^^^^ (⋯ "d times" ⋯ (n ^^^^^ (n)))) |
, written .
- Octa-exponentials:
b ^^^^^ (b ^^^^^ (⋯ "n times" ⋯ (b ^^^^^ (b)))) |
, written .
- Octation inverses
Notes
Notes