Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Addition

This is a good article. Click here for more information.
From Wikipedia, the free encyclopedia
Arithmetic operation
For other uses, seeAddition (disambiguation).
"Add" redirects here. For other uses, seeADD (disambiguation).

3 + 2 = 5 withapples, a popular choice in textbooks[1]

Addition, usually denoted with theplus sign+, is one of the four basicoperations ofarithmetic, the other three beingsubtraction,multiplication, anddivision. The addition of twowhole numbers results in the total orsum of those values combined. For example, the adjacent image shows two columns of apples, one with three apples and the other with two apples, totaling to five apples. This observation is expressed as"3 + 2 = 5", which is read as "three plus twoequals five".

Besidescounting items, addition can also be defined and executed without referring toconcrete objects, using abstractions callednumbers instead, such asintegers,real numbers, andcomplex numbers. Addition belongs to arithmetic, a branch ofmathematics. Inalgebra, another area of mathematics, addition can also be performed on abstract objects such asvectors,matrices, and elements ofadditive groups.

Addition has several important properties. It iscommutative, meaning that the order of thenumbers being added does not matter, so3 + 2 = 2 + 3, and it isassociative, meaning that when one adds more than two numbers, the order in which addition is performed does not matter. Repeated addition of1 is the same as counting (seeSuccessor function). Addition of0 does not change a number. Addition also obeys rules concerning related operations such as subtraction and multiplication.

Performing addition is one of the simplest numerical tasks to perform. Addition of very small numbers is accessible to toddlers; the most basic task,1 + 1, can be performed by infants as young as five months, and even some members of other animal species. Inprimary education, students are taught to add numbers in thedecimal system, beginning with single digits and progressively tackling more difficult problems. Mechanical aids range from the ancientabacus to the moderncomputer, where research on the most efficient implementations of addition continues to this day.

Arithmetic operations
Addition (+)
term+termsummand+summandaddend+addendaugend+addend}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{term}}\,+\,{\text{term}}\\\scriptstyle {\text{summand}}\,+\,{\text{summand}}\\\scriptstyle {\text{addend}}\,+\,{\text{addend}}\\\scriptstyle {\text{augend}}\,+\,{\text{addend}}\end{matrix}}\right\}\,=\,}sum{\displaystyle \scriptstyle {\text{sum}}}
Subtraction (−)
termtermminuendsubtrahend}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{term}}\,-\,{\text{term}}\\\scriptstyle {\text{minuend}}\,-\,{\text{subtrahend}}\end{matrix}}\right\}\,=\,}difference{\displaystyle \scriptstyle {\text{difference}}}
Multiplication (×)
factor×factormultiplier×multiplicand}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{factor}}\,\times \,{\text{factor}}\\\scriptstyle {\text{multiplier}}\,\times \,{\text{multiplicand}}\end{matrix}}\right\}\,=\,}product{\displaystyle \scriptstyle {\text{product}}}
Division (÷)
dividenddivisornumeratordenominator}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\frac {\scriptstyle {\text{dividend}}}{\scriptstyle {\text{divisor}}}}\\[1ex]\scriptstyle {\frac {\scriptstyle {\text{numerator}}}{\scriptstyle {\text{denominator}}}}\end{matrix}}\right\}\,=\,}{fractionquotientratio{\displaystyle \scriptstyle \left\{{\begin{matrix}\scriptstyle {\text{fraction}}\\\scriptstyle {\text{quotient}}\\\scriptstyle {\text{ratio}}\end{matrix}}\right.}
Exponentiation
baseexponentbasepower}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{base}}^{\text{exponent}}\\\scriptstyle {\text{base}}^{\text{power}}\end{matrix}}\right\}\,=\,}power{\displaystyle \scriptstyle {\text{power}}}
nth root (√)
radicanddegree={\displaystyle \scriptstyle {\sqrt[{\text{degree}}]{\scriptstyle {\text{radicand}}}}\,=\,}root{\displaystyle \scriptstyle {\text{root}}}
Logarithm (log)
logbase(anti-logarithm)={\displaystyle \scriptstyle \log _{\text{base}}({\text{anti-logarithm}})\,=\,}logarithm{\displaystyle \scriptstyle {\text{logarithm}}}

Notation and terminology

[edit]
The plus sign

Addition is written using theplus sign "+"between the terms, and the result is expressed with anequals sign. For example,1+2=3{\displaystyle 1+2=3} reads "one plus two equals three".[2] Nonetheless, some situations where addition is "understood", even though no symbol appears: a whole number followed immediately by afraction indicates the sum of the two, called amixed number, with an example,[3]312=3+12=3.5.{\displaystyle 3{\frac {1}{2}}=3+{\frac {1}{2}}=3.5.} This notation can cause confusion, since in most other contexts,juxtaposition denotesmultiplication instead.[4]

The terms of addends in the operation of an addition

The numbers or the objects to be added in general addition are collectively referred to as theterms,[5] theaddends or thesummands.[2] This terminology carries over to the summation of multiple terms.This is to be distinguished fromfactors, which aremultiplied.Some authors call the first addend theaugend.[6] In fact, during theRenaissance, many authors did not consider the first addend an "addend" at all. Today, due to thecommutative property of addition, "augend" is rarely used, and both terms are generally called addends.[7]

All of the above terminology derives fromLatin. "Addition" and "add" areEnglish words derived from the Latinverbaddere, which is in turn acompound ofad "to" anddare "to give", from theProto-Indo-European root*deh₃- "to give"; thus toadd is togive to.[7] Using thegerundivesuffix-nd results in "addend", "thing to be added".[a] Likewise fromaugere "to increase", one gets "augend", "thing to be increased".[8]

Redrawn illustration fromThe Art of Nombryng, one of the first English arithmetic texts, in the 15th century.[9]

"Sum" and "summand" derive from the Latinnounsumma "the highest" or "the top", used in Medieval Latin phrasesumma linea ("top line") meaning the sum of a column of numerical quantities, following theancient Greek andRoman practice of putting the sum at the top of a column.[10]Addere andsummare date back at least toBoethius, if not to earlier Roman writers such asVitruvius andFrontinus; Boethius also used several other terms for the addition operation. The laterMiddle English terms "adden" and "adding" were popularized byChaucer.[11]

Definition and interpretations

[edit]

Addition is one of the four basicoperations ofarithmetic, with the other three beingsubtraction,multiplication, anddivision. This operation works by adding two or more terms.[12] An arbitrary of many operation of additions is called thesummation.[13] An infinite summation is a delicate procedure known as aseries,[14] and it can be expressed throughcapital sigma notation{\textstyle \sum }, which compactly denotesiteration of the operation of addition based on the given indexes.[15] For example,k=15k2=12+22+32+42+52=55.{\displaystyle \sum _{k=1}^{5}k^{2}=1^{2}+2^{2}+3^{2}+4^{2}+5^{2}=55.}

Addition is used to model many physical processes. Even for the simple case of addingnatural numbers, there are many possible interpretations and even more visual representations.

Combining sets

[edit]
One set has three shapes while the other set has two. The total of shapes is five, which is a consequence of the addition of the objects from the two sets:3+2=5{\displaystyle 3+2=5}.

Possibly the most basic interpretation of addition lies in combiningsets, that is:[2]

When two or more disjoint collections are combined into a single collection, the number of objects in the single collection is the sum of the numbers of objects in the original collections.

This interpretation is easy to visualize, with little danger of ambiguity. It is also useful in higher mathematics (for the rigorous definition it inspires, see§ Natural numbers below). However, it is not obvious how one should extend this interpretation to include fractional or negative numbers.[16]

One possibility is to consider collections of objects that can be easily divided, such as pies or, still better, segmented rods. Rather than solely combining collections of segments, rods can be joined end-to-end, which illustrates another conception of addition: adding not the rods but the lengths of the rods.[17]

Extending a length

[edit]
A number-line visualization of the algebraic addition2+4=6{\displaystyle 2+4=6}. A "jump" that has a distance of2{\displaystyle 2} followed by another that is as long as4{\displaystyle 4}, is the same as a translation by6{\displaystyle 6}.
A number-line visualization of the unary addition2+4=6{\displaystyle 2+4=6}. A translation by4{\displaystyle 4} is equivalent to four translations by1{\displaystyle 1}.

A second interpretation of addition comes from extending an initial length by a given length:[18]

When an original length is extended by a given amount, the final length is the sum of the original length and the length of the extension.

The suma+b{\displaystyle a+b} can be interpreted as abinary operation that combinesa{\displaystyle a} andb{\displaystyle b} algebraically, or it can be interpreted as the addition ofb{\displaystyle b} more units toa{\displaystyle a}. Under the latter interpretation, the parts of a suma+b{\displaystyle a+b} play asymmetric roles, and the operationa+b{\displaystyle a+b} is viewed as applying theunary operation+b{\displaystyle +b} toa{\displaystyle a}.[19] Instead of calling botha{\displaystyle a} andb{\displaystyle b} addends, it is more appropriate to calla{\displaystyle a} the "augend" in this case, sincea{\displaystyle a} plays a passive role. The unary view is also useful when discussingsubtraction, because each unary addition operation has an inverse unary subtraction operation, and vice versa.

Properties

[edit]

Commutativity

[edit]
4 + 2 = 2 + 4 with blocks

Addition iscommutative, meaning that one can change the order of the terms in a sum, but still get the same result. Symbolically, ifa{\displaystyle a} andb{\displaystyle b} are any two numbers, then:[20]a+b=b+a.{\displaystyle a+b=b+a.}The fact that addition is commutative is known as the "commutative law of addition"[21] or "commutative property of addition".[22] Some otherbinary operations are commutative too as inmultiplication,[23] but others are not as insubtraction anddivision.[24]

Associativity

[edit]
2 + (1 + 3) = (2 + 1) + 3 with segmented rods

Addition isassociative, which means that when three or more numbers are added together, theorder of operations does not change the result. For any three numbersa{\displaystyle a},b{\displaystyle b}, andc{\displaystyle c}, it is true that:[25](a+b)+c=a+(b+c).{\displaystyle (a+b)+c=a+(b+c).}For example,(1+2)+3=1+(2+3){\displaystyle (1+2)+3=1+(2+3)}.

When addition is used together with other operations, theorder of operations becomes important. In the standard order of operations, addition is a lower priority thanexponentiation,nth roots, multiplication and division, but is given equal priority to subtraction.[26]

Identity element

[edit]
5 + 0 = 5 with bags of dots

Addingzero to any number does not change the number. In other words, zero is theidentity element for addition, and is also known as theadditive identity. In symbols, for everya{\displaystyle a}, one has:[25]a+0=0+a=a.{\displaystyle a+0=0+a=a.}This law was first identified inBrahmagupta'sBrahmasphutasiddhanta in 628 AD, although he wrote it as three separate laws, depending on whethera{\displaystyle a} is negative, positive, or zero itself, and he used words rather than algebraic symbols. LaterIndian mathematicians refined the concept; around the year 830,Mahavira wrote, "zero becomes the same as what is added to it", corresponding to the unary statement0+a=a{\displaystyle 0+a=a}. In the 12th century,Bhaskara wrote, "In the addition of cipher, or subtraction of it, the quantity, positive or negative, remains the same", corresponding to the unary statementa+0=a{\displaystyle a+0=a}.[27]

Successor

[edit]
Main article:Successor function

Within the context of integers, addition ofone also plays a special role: for any integera{\displaystyle a}, the integera+1{\displaystyle a+1} is the least integer greater thana{\displaystyle a}, also known as thesuccessor ofa{\displaystyle a}. For instance, 3 is the successor of 2, and 7 is the successor of 6. Because of this succession, the value ofa+b{\displaystyle a+b} can also be seen as theb{\displaystyle b}-th successor ofa{\displaystyle a}, making addition an iterated succession. For example,6 + 2 is 8, because 8 is the successor of 7, which is the successor of 6, making 8 the second successor of 6.[28]

Units

[edit]

To numerically add physical quantities withunits, they must be expressed with common units.[29] For example, adding 50 milliliters to 150 milliliters gives 200 milliliters. However, if a measure of 5 feet is extended by 2 inches, the sum is 62 inches, since 60 inches is synonymous with 5 feet. On the other hand, it is usually meaningless to try to add 3 meters and 4 square meters, since those units are incomparable; this sort of consideration is fundamental indimensional analysis.[30]

Performing addition

[edit]

Innate ability

[edit]

Studies on mathematical development starting around the 1980s have exploited the phenomenon ofhabituation:infants look longer at situations that are unexpected.[31] A seminal experiment byKaren Wynn in 1992 involvingMickey Mouse dolls manipulated behind a screen demonstrated that five-month-old infantsexpect1 + 1 to be 2, and they are comparatively surprised when a physical situation seems to imply that1 + 1 is either 1 or 3. This finding has since been affirmed by a variety of laboratories using different methodologies.[32] Another 1992 experiment with oldertoddlers, between 18 and 35 months, exploited their development of motor control by allowing them to retrieveping-pong balls from a box; the youngest responded well for small numbers, while older subjects were able to compute sums up to 5.[33]

Even some nonhuman animals show a limited ability to add, particularlyprimates. In a 1995 experiment imitating Wynn's 1992 result (but usingeggplants instead of dolls),rhesus macaque andcottontop tamarin monkeys performed similarly to human infants. More dramatically, after being taught the meanings of theArabic numerals 0 through 4, onechimpanzee was able to compute the sum of two numerals without further training.[34] More recently,Asian elephants have demonstrated an ability to perform basic arithmetic.[35]

Addition by counting

[edit]

Typically, children first mastercounting. When given a problem that requires that two items and three items be combined, young children model the situation with physical objects, often fingers or a drawing, and then count the total. As they gain experience, they learn or discover the strategy of "counting-on": asked to find two plus three, children count three past two, saying "three, four,five" (usually ticking off fingers), and arriving at five. This strategy seems almost universal; children can easily pick it up from peers or teachers.[36] Most discover it independently. With additional experience, children learn to add more quickly by exploiting the commutativity of addition by counting up from the larger number, in this case, starting with three and counting "four,five." Eventually children begin to recall certain addition facts ("number bonds"), either through experience or rote memorization. Once some facts are committed to memory, children begin to derive unknown facts from known ones. For example, a child asked to add six and seven may know that6 + 6 = 12 and then reason that6 + 7 is one more, or 13.[37] Such derived facts can be found very quickly and most elementary school students eventually rely on a mixture of memorized and derived facts to add fluently.[38]

Different nations introduce whole numbers and arithmetic at different ages, with many countries teaching addition in pre-school.[39] However, throughout the world, addition is taught by the end of the first year of elementary school.[40]

Single-digit addition

[edit]

An ability to add a pair of single digits (numbers from 0 to 9) is a prerequisite for addition of arbitrary numbers in thedecimal system. With 10 choices for each of the two digits to be added, this makes 100 single-digit "addition facts", which can be presented in anaddition table.

+0123456789
00123456789
112345678910
2234567891011
33456789101112
445678910111213
5567891011121314
66789101112131415
778910111213141516
8891011121314151617
99101112131415161718

Learning to fluently and accurately compute single-digit additions is a major focus of early schooling in arithmetic. Sometimes students are encouraged to memorize the full addition table byrote, but pattern-based strategies are typically more enlightening and, for most people, more efficient:[41]

  • Commutative property: Mentioned above, using the patterna+b=b+a{\displaystyle a+b=b+a} reduces the number of "addition facts" from 100 to 55.
  • One or two more: Adding 1 or 2 is a basic task, and it can be accomplished through counting on or, ultimately,intuition.[41]
  • Zero: Since zero is the additive identity, adding zero is trivial. Nonetheless, in the teaching of arithmetic, some students are introduced to addition as a process that always increases the addends;word problems may help rationalize the "exception" of zero.[41]
  • Doubles: Adding a number to itself is related to counting by two and tomultiplication. Doubles facts form a backbone for many related facts, and students find them relatively easy to grasp.[41]
  • Near-doubles: Sums such as 6 + 7 = 13 can be quickly derived from the doubles fact6 + 6 = 12 by adding one more, or from7 + 7 = 14 but subtracting one.[41]
  • Five and ten: Sums of the form 5 +x and 10 +x are usually memorized early and can be used for deriving other facts. For example,6 + 7 = 13 can be derived from5 + 7 = 12 by adding one more.[41]
  • Making ten: An advanced strategy uses 10 as an intermediate for sums involving 8 or 9; for example,8 + 6 = 8 + 2 + 4 =10 + 4 = 14.[41]

As students grow older, they commit more facts to memory and learn to derive other facts rapidly and fluently. Many students never commit all the facts to memory, but can still find any basic fact quickly.[38]

Carry

[edit]
Main article:Carry (arithmetic)
An addition withcarry

The standard algorithm for adding multidigit numbers is to align the addends vertically and add the columns by using the above addition table, starting from the ones column on the right. If the result of a column exceeds nine, the extra digit is "carried" into the next column. For example, in the following image, the ones in the addition of59 + 27 is 9 + 7 = 16, and the digit 1 is the carry.[42] An alternate strategy starts adding from the most significant digit on the left; this route makes carrying a little clumsier, but it is faster at getting a rough estimate of the sum.[b]

Decimal fractions

[edit]

Decimal fractions can be added by a simple modification of the above process. One aligns two decimal fractions above each other, with the decimal point in the same location. If necessary, one can add trailing zeros to a shorter decimal to make it the same length as the longer decimal. Finally, one performs the same addition process as above, except the decimal point is placed in the answer, exactly where it was placed in the summands.[44] As an example, 45.1 + 4.34 can be solved as follows:

   4 5 . 1 0+  0 4 . 3 4————————————   4 9 . 4 4

Scientific notation

[edit]
Main article:Scientific notation § Basic operations

Inscientific notation, numbers are written in the formx=a×10b{\displaystyle x=a\times 10^{b}}, wherea{\displaystyle a} is thesignificand and10b{\displaystyle 10^{b}} is the exponential part. To add numbers in scientific notation, they should be expressed with the same exponent, so that the two significands can simply be added.[45]

For example:

2.34×105+5.67×106=2.34×105+0.567×105=2.907×105.{\displaystyle {\begin{aligned}&2.34\times 10^{-5}+5.67\times 10^{-6}\\&\quad =2.34\times 10^{-5}+0.567\times 10^{-5}\\&\quad =2.907\times 10^{-5}.\end{aligned}}}

Non-decimal

[edit]
Main article:Binary addition

Addition in other bases is very similar to decimal addition. As an example, one can consider addition in binary.[46] Adding two single-digit binary numbers is relatively simple, using a form of carrying:

0 + 0 → 0
0 + 1 → 1
1 + 0 → 1
1 + 1 → 0, carry 1 (since 1 + 1 = 2 = 0 + (1 × 21))

Adding two "1" digits produces a digit "0", while 1 must be added to the next column. This is similar to what happens in decimal when certain single-digit numbers are added together; if the result equals or exceeds the value of the radix (10), the digit to the left is incremented:

5 + 5 → 0, carry 1 (since 5 + 5 = 10 = 0 + (1 × 101))
7 + 9 → 6, carry 1 (since 7 + 9 = 16 = 6 + (1 × 101))

This is known ascarrying.[47] When the result of an addition exceeds the value of a digit, the procedure is to "carry" the excess amount divided by the radix (that is, 10/10) to the left, adding it to the next positional value. This is correct since the next position has a weight that is higher by a factor equal to the radix. Carrying works the same way in binary:

1 1 1 1 1    (carried digits)    0 1 1 0 1+   1 0 1 1 1—————————————  1 0 0 1 0 0 = 36

In this example, two numerals are being added together: 011012 (1310) and 101112 (2310). The top row shows the carry bits used. Starting in the rightmost column,1 + 1 = 102. The 1 is carried to the left, and the 0 is written at the bottom of the rightmost column. The second column from the right is added:1 + 0 + 1 = 102 again; the 1 is carried, and 0 is written at the bottom. The third column:1 + 1 + 1 = 112. This time, a 1 is carried, and a 1 is written in the bottom row. Proceeding like this gives the final answer 1001002 (3610).

Computers

[edit]
Addition with an op-amp. SeeSumming amplifier for details.

Analog computers work directly with physical quantities, so their addition mechanisms depend on the form of the addends. A mechanical adder might represent two addends as the positions of sliding blocks, in which case they can be added with anaveraginglever. If the addends are the rotation speeds of twoshafts, they can be added with adifferential. A hydraulic adder can add thepressures in two chambers by exploitingNewton's second law to balance forces on an assembly ofpistons. The most common situation for a general-purpose analog computer is to add twovoltages (referenced toground); this can be accomplished roughly with aresistornetwork, but a better design exploits anoperational amplifier.[48]

Addition is also fundamental to the operation ofdigital computers, where the efficiency of addition, in particular thecarry mechanism, is an important limitation to overall performance.[49]

Part of Charles Babbage'sDifference Engine including the addition and carry mechanisms

Theabacus, also called a counting frame, is a calculating tool that was in use centuries before the adoption of the written modern numeral system and is still widely used by merchants, traders and clerks inAsia,Africa, and elsewhere; it dates back to at least 2700–2300 BC, when it was used inSumer.[50]

Blaise Pascal invented the mechanical calculator in 1642;[51] it was the first operationaladding machine.Pascal's calculator was limited by its gravity-assisted carry mechanism, which forced its wheels to only turn one way so it could add. To subtract, the operator had to use thePascal's calculator's complement, which required as many steps as an addition.[52]Gottfried Leibniz built thestepped reckoner, another mechanical calculator, finished in 1694, andGiovanni Poleni improved on the design in 1709 with a calculating clock made of wood that could perform all four arithmetical operations. These early attempts were not commercially successful but inspired later mechanical calculators of the 19th century.[53]

"Full adder" logic circuit that adds two binary digits,A andB, along with a carry inputCin, producing the sum bit,S, and a carry output,Cout.

Adders execute integer addition in electronic digital computers, usually usingbinary arithmetic. The simplest architecture is the ripple carry adder, which follows the standard multi-digit algorithm. One slight improvement is thecarry skip design, again following human intuition; one does not perform all the carries in computing999 + 1, but one bypasses the group of 9s and skips to the answer.[54]

In practice, computational addition may be achieved viaXOR andAND bitwise logical operations in conjunction with bitshift operations. Both XOR and AND gates are straightforward to realize in digital logic, allowing the realization offull adder circuits, which in turn may be combined into more complex logical operations. In modern digital computers, integer addition is typically the fastest arithmetic instruction, yet it has the largest impact on performance since it underlies allfloating-point operations as well as such basic tasks asaddress generation duringmemory access and fetchinginstructions duringbranching. To increase speed, modern designs calculate digits inparallel; these schemes go by such names as carry select,carry lookahead, and theLing pseudocarry. Many implementations are, in fact, hybrids of these last three designs.[55]

Some decimal computers in the late 1950s and early 1960s used add tables instead of adders, e.g., RCA 301,[56]IBM 1620.[57]

Arithmetic implemented on a computer can deviate from the mathematical ideal in various ways. For example, if the result of an addition is too large for a computer to store, anarithmetic overflow occurs, resulting in an error message and/or an incorrect answer. Unanticipated arithmetic overflow is a fairly common cause ofprogram errors. Such overflow bugs may be hard to discover and diagnose because they may manifest themselves only for very large input data sets, which are less likely to be used in validation tests.[58] TheYear 2000 problem was a series of bugs where overflow errors occurred due to the use of a 2-digit format for years.[59]

Computers have another way of representing numbers, calledfloating-point arithmetic, which is similar to the scientific notation described above and which reduces the overflow problem. Each floating point number has two parts, an exponent and a mantissa. To add two floating-point numbers, the exponents must match, which typically means shifting the mantissa of the smaller number. If the disparity between the larger and smaller numbers is too great, a loss of precision may result. If many smaller numbers are to be added to a large number, it is best to add the smaller numbers together first and then add the total to the larger number, rather than adding small numbers to the large number one at a time. This makes floating-point addition non-associative in general.[60]

Addition of numbers

[edit]

To prove the usual properties of addition, one must first define addition for the context in question. Addition is first defined on thenatural numbers. Inset theory, addition is then extended to progressively larger sets that include the natural numbers: theintegers, therational numbers, and thereal numbers.[61] Inmathematics education,[c] positive fractions are added before negative numbers are even considered; this is also the historical route.[63]

Natural numbers

[edit]
Further information:Natural number

There are two popular ways to define the sum of two natural numbersa{\displaystyle a} andb{\displaystyle b}. If one defines natural numbers to be thecardinalities of finite sets (the cardinality of a set is the number of elements in the set), then it is appropriate to define their sum as follows:[64]

LetN(S){\displaystyle N(S)} be the cardinality of a setS{\displaystyle S}. Take two disjoint setsA{\displaystyle A} andB{\displaystyle B}, withN(A)=a{\displaystyle N(A)=a} andN(B)=b{\displaystyle N(B)=b}. Thena+b{\displaystyle a+b} is defined asN(AB){\displaystyle N(A\cup B)}.

HereAB{\displaystyle A\cup B} means theunion ofA{\displaystyle A} andB{\displaystyle B}. An alternate version of this definition allowsA{\displaystyle A} andB{\displaystyle B} to possibly overlap and then takes theirdisjoint union, a mechanism that allows common elements to be separated out and therefore counted twice.

The other popular definition is recursive:[65]

Letn+{\displaystyle n^{+}} be the successor ofn{\displaystyle n}, that is the number followingn{\displaystyle n} in the natural numbers, so0+=1{\displaystyle 0^{+}=1},1+=2{\displaystyle 1^{+}=2}. Definea+0=a{\displaystyle a+0=a}. Define the general sum recursively bya+b+=(a+b)+{\displaystyle a+b^{+}=(a+b)^{+}}. Hence1+1=1+0+=(1+0)+=1+=2{\displaystyle 1+1=1+0^{+}=(1+0)^{+}=1^{+}=2}.

Again, there are minor variations upon this definition in the literature. Taken literally, the above definition is an application of therecursion theorem on thepartially ordered setN2{\displaystyle \mathbb {N} ^{2}}.[66] On the other hand, some sources prefer to use a restricted recursion theorem that applies only to the set of natural numbers. One then considersa{\displaystyle a} to be temporarily "fixed", applies recursion onb{\displaystyle b} to define a function "a+{\displaystyle a+}", and pastes these unary operations for alla{\displaystyle a} together to form the full binary operation.[67]

This recursive formulation of addition was developed by Dedekind as early as 1854, and he would expand upon it in the following decades. He proved the associative and commutative properties, among others, throughmathematical induction.[68]

Integers

[edit]
Further information:Integer

The simplest conception of an integer is that it consists of anabsolute value (which is a natural number) and asign (generally eitherpositive ornegative). The integer zero is a special third case, being neither positive nor negative. The corresponding definition of addition must proceed by cases:[69]

For an integern{\displaystyle n}, let|n|{\displaystyle |n|} be its absolute value. Leta{\displaystyle a} andb{\displaystyle b} be integers. If eithera{\displaystyle a} orb{\displaystyle b} is zero, treat it as an identity. Ifa{\displaystyle a} andb{\displaystyle b} are both positive, definea+b=|a|+|b|{\displaystyle a+b=|a|+|b|}. Ifa{\displaystyle a} andb{\displaystyle b} are both negative, definea+b=(|a|+|b|){\displaystyle a+b=-(|a|+|b|)}. Ifa{\displaystyle a} andb{\displaystyle b} have different signs, definea+b{\displaystyle a+b} to be the difference between|a|{\displaystyle |a|} and|b|{\displaystyle |b|}, with the sign of the term whose absolute value is larger.

As an example,−6 + 4 = −2; because −6 and 4 have different signs, their absolute values are subtracted, and since the absolute value of the negative term is larger, the answer is negative.

Although this definition can be useful for concrete problems, the number of cases to consider complicates proofs unnecessarily. So the following method is commonly used for defining integers. It is based on the remark that every integer is the difference of two natural integers and that two such differences,ab{\displaystyle a-b} andcd{\displaystyle c-d} are equal if and only ifa+d=b+c{\displaystyle a+d=b+c}. So, one can define formally the integers as theequivalence classes ofordered pairs of natural numbers under theequivalence relation(a,b)(c,d){\displaystyle (a,b)\sim (c,d)} if and only ifa+d=b+c{\displaystyle a+d=b+c}.[70] The equivalence class of(a,b){\displaystyle (a,b)} contains either(ab,0){\displaystyle (a-b,0)} ifab{\displaystyle a\geq b}, or(0,ba){\displaystyle (0,b-a)} if otherwise. Given thatn{\displaystyle n} is a natural number, then one can denote+n{\displaystyle +n} the equivalence class of(n,0){\displaystyle (n,0)}, and byn{\displaystyle -n} the equivalence class of(0,n){\displaystyle (0,n)}. This allows identifying the natural numbern{\displaystyle n} with the equivalence class+n{\displaystyle +n}.

The addition of ordered pairs is done component-wise:[71](a,b)+(c,d)=(a+c,b+d).{\displaystyle (a,b)+(c,d)=(a+c,b+d).}A straightforward computation shows that the equivalence class of the result depends only on the equivalence classes of the summands, and thus that this defines an addition of equivalence classes, that is, integers.[72] Another straightforward computation shows that this addition is the same as the above case definition.

Rational numbers (fractions)

[edit]
Main article:Field of fractions

Addition ofrational numbers involves thefractions. The computation can be done by using theleast common denominator, but a conceptually simpler definition involves only integer addition and multiplication:ab+cd=ad+bcbd.{\displaystyle {\frac {a}{b}}+{\frac {c}{d}}={\frac {ad+bc}{bd}}.}As an example, the sum34+18=3×8+4×14×8=24+432=2832=78{\textstyle {\frac {3}{4}}+{\frac {1}{8}}={\frac {3\,\times \,8\,+\,4\,\times \,1}{4\times 8}}={\frac {24\,+\,4}{32}}={\frac {28}{32}}={\frac {7}{8}}}.[73]

Addition of fractions is much simpler when thedenominators are the same; in this case, one can simply add the numerators while leaving the denominator the same:ac+bc=a+bc,{\displaystyle {\frac {a}{c}}+{\frac {b}{c}}={\frac {a+b}{c}},}so14+24=1+24=34{\textstyle {\frac {1}{4}}+{\frac {2}{4}}={\frac {1\,+\,2}{4}}={\frac {3}{4}}}.[73]

The commutativity and associativity of rational addition are easy consequences of the laws of integer arithmetic.[74]

Real numbers

[edit]
Further information:Construction of the real numbers

A common construction of the set of real numbers is the Dedekind completion of the set of rational numbers. A real number is defined to be aDedekind cut of rationals: anon-empty set of rationals that is closed downward and has nogreatest element. The sum of real numbersa andb is defined element by element:[75]a+b={q+rqa,rb}.{\displaystyle a+b=\{q+r\mid q\in a,r\in b\}.}This definition was first published, in a slightly modified form, byRichard Dedekind in 1872.[76]The commutativity and associativity of real addition are immediate; defining the real number 0 as the set of negative rationals, it is easily seen as the additive identity. Probably the trickiest part of this construction pertaining to addition is the definition of additive inverses.[77]

Addingπ2/6{\displaystyle \pi ^{2}/6} ande{\displaystyle e} using Cauchy sequences of rationals.

Unfortunately, dealing with the multiplication of Dedekind cuts is a time-consuming case-by-case process similar to the addition of signed integers.[78] Another approach is the metric completion of the rational numbers. A real number is essentially defined to be the limit of aCauchy sequence of rationals, lim an. Addition is defined term by term:[79]limnan+limnbn=limn(an+bn).{\displaystyle \lim _{n}a_{n}+\lim _{n}b_{n}=\lim _{n}(a_{n}+b_{n}).}This definition was first published byGeorg Cantor, also in 1872, although his formalism was slightly different.[80]One must prove that this operation is well-defined, dealing with co-Cauchy sequences. Once that task is done, all the properties of real addition follow immediately from the properties of rational numbers. Furthermore, the other arithmetic operations, including multiplication, have straightforward, analogous definitions.[81]

Complex numbers

[edit]
Addition of two complex numbers can be done geometrically by constructing a parallelogram.

Complex numbers are added by adding the real and imaginary parts of the summands.[82][83] That is to say:

(a+bi)+(c+di)=(a+c)+(b+d)i.{\displaystyle (a+bi)+(c+di)=(a+c)+(b+d)i.}

Using the visualization of complex numbers in the complex plane, the addition has the following geometric interpretation: the sum of two complex numbersA andB, interpreted as points of the complex plane, is the pointX obtained by building aparallelogram three of whose vertices areO,A andB.[84]

Generalizations

[edit]
See also:Group (mathematics),Ring (mathematics),Module (mathematics),Vector space,Field (mathematics), andAlgebra over a field

Many binary operations can be viewed as generalizations of the addition operation on the real numbers. The field of algebra is centrally concerned with such generalized operations, and they also appear inset theory andcategory theory.

Abelian group

[edit]
Main article:Abelian group

Ingroup theory, aGroup is an algebraic structure that allows for composing any two elements.

In the special case where the order does not matter, the composition operator is sometimes called addition. Such groups are referred to as Abelian or commutative; the composition operator is often written as "+".

Linear algebra

[edit]
Main articles:Vector addition,Matrix addition,Modular arithmetic, andLinear combination

Inlinear algebra, avector space is an algebraic structure that allows for adding any twovectors and for scaling vectors. A familiar vector space is the set of all ordered pairs of real numbers; the ordered pair(a,b){\displaystyle (a,b)} is interpreted as a vector from the origin in the Euclidean plane to the point(a,b){\displaystyle (a,b)} in the plane. The sum of two vectors is obtained by adding their individual coordinates:(a,b)+(c,d)=(a+c,b+d).{\displaystyle (a,b)+(c,d)=(a+c,b+d).}This addition operation is central toclassical mechanics, in whichvelocities,accelerations andforces are all represented by vectors.[85]

Matrix addition is defined for two matrices of the same dimensions. The sum of twom ×n (pronounced "m by n") matricesA andB, denoted byA +B, is again anm ×n matrix computed by adding corresponding elements:[86][87]A+B=[a11a12a1na21a22a2nam1am2amn]+[b11b12b1nb21b22b2nbm1bm2bmn]=[a11+b11a12+b12a1n+b1na21+b21a22+b22a2n+b2nam1+bm1am2+bm2amn+bmn]{\displaystyle {\begin{aligned}\mathbf {A} +\mathbf {B} &={\begin{bmatrix}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\\\end{bmatrix}}+{\begin{bmatrix}b_{11}&b_{12}&\cdots &b_{1n}\\b_{21}&b_{22}&\cdots &b_{2n}\\\vdots &\vdots &\ddots &\vdots \\b_{m1}&b_{m2}&\cdots &b_{mn}\\\end{bmatrix}}\\[8mu]&={\begin{bmatrix}a_{11}+b_{11}&a_{12}+b_{12}&\cdots &a_{1n}+b_{1n}\\a_{21}+b_{21}&a_{22}+b_{22}&\cdots &a_{2n}+b_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}+b_{m1}&a_{m2}+b_{m2}&\cdots &a_{mn}+b_{mn}\\\end{bmatrix}}\\\end{aligned}}}

For example:

[131012]+[007521]=[1+03+01+70+51+22+1]=[138533]{\displaystyle {\begin{aligned}{\begin{bmatrix}1&3\\1&0\\1&2\end{bmatrix}}+{\begin{bmatrix}0&0\\7&5\\2&1\end{bmatrix}}&={\begin{bmatrix}1+0&3+0\\1+7&0+5\\1+2&2+1\end{bmatrix}}\\[8mu]&={\begin{bmatrix}1&3\\8&5\\3&3\end{bmatrix}}\end{aligned}}}

Inmodular arithmetic, the set of available numbers is restricted to a finite subset of the integers, and addition "wraps around" when reaching a certain value, called the modulus.[88] For example, the set of integers modulo 12 has twelve elements; it inherits an addition operation from the integers that is central tomusical set theory.[89] The set of integers modulo 2 has just two elements; the addition operation it inherits is known inBoolean logic as the "exclusive or" function.[90] A similar "wrap around" operation arises ingeometry, where the sum of twoangle measures is often taken to be their sum as real numbers modulo 2π. This amounts to an addition operation on thecircle, which in turn generalizes to the operations of higher-dimensionalLie groups.[91]

The general theory ofabstract algebra allows an "addition" operation to be anyassociative andcommutative operation on a set. Basicalgebraic structures with such an addition operation includecommutative monoids andabelian groups.[92]

Linear combinations combine multiplication and summation; they are sums in which each term has a multiplier, usually areal orcomplex number. Linear combinations are especially useful in contexts where straightforward addition would violate some normalization rule, such asmixing ofstrategies ingame theory orsuperposition ofstates inquantum mechanics.[93]

Set theory and category theory

[edit]

A far-reaching generalization of the addition of natural numbers is the addition ofordinal numbers andcardinal numbers in set theory. These give two different generalizations of the addition of natural numbers to thetransfinite. Unlike most addition operations, the addition of ordinal numbers is not commutative.[94] Addition of cardinal numbers, however, is a commutative operation closely related to thedisjoint union operation.[95]

Incategory theory, disjoint union is seen as a particular case of thecoproduct operation,[96] and general coproducts are perhaps the most abstract of all the generalizations of addition. The coproduct such asdirect sum is named to evoke their connection with addition.[97]

Related operations

[edit]

Arithmetic

[edit]

Subtraction can be thought of as a kind of addition—that is, the addition of anadditive inverse. Subtraction is itself a sort of inverse to addition, in that addingx{\displaystyle x} and subtractingx{\displaystyle x} areinverse functions.[98] Given a set with an addition operation, one cannot always define a corresponding subtraction operation on that set; the set of natural numbers is a simple example. On the other hand, a subtraction operation uniquely determines an addition operation, an additive inverse operation, and an additive identity; for this reason, an additive group can be described as a set that is closed under subtraction.[99]

Multiplication can be thought of asrepeated addition. If a single termx appears in a sumn{\displaystyle n} times, then the sum is theproduct ofn{\displaystyle n} andx. Nonetheless, this works only fornatural numbers.[100] By the definition in general, multiplication is the operation between two numbers, called the multiplier and the multiplicand, that are combined into a single number called the product.[101]

A circular slide rule

In the real and complex numbers, addition and multiplication can be interchanged by theexponential function:[102]ea+b=eaeb.{\displaystyle e^{a+b}=e^{a}e^{b}.}This identity allows multiplication to be carried out by consulting atable oflogarithms and computing addition by hand; it also enables multiplication on aslide rule. The formula is still a good first-order approximation in the broad context ofLie groups, where it relates multiplication of infinitesimal group elements with addition of vectors in the associatedLie algebra.[103]

There are even more generalizations of multiplication than addition.[104] In general, multiplication operations alwaysdistribute over addition; this requirement is formalized in the definition of aring. In some contexts, integers, distributivity over addition, and the existence of a multiplicative identity are enough to determine the multiplication operation uniquely. The distributive property also provides information about the addition operation; by expanding the product(1+1)(a+b){\displaystyle (1+1)(a+b)} in both ways, one concludes that addition is forced to be commutative. For this reason, ring addition is commutative in general.[105]

Division is an arithmetic operation remotely related to addition. Sincea/b=ab1{\displaystyle a/b=ab^{-1}}, division is right distributive over addition:(a+b)/c=a/c+b/c{\displaystyle (a+b)/c=a/c+b/c}.[106] However, division is not left distributive over addition, such as1/(2+2){\displaystyle 1/(2+2)} is not the same as1/2+1/2{\displaystyle 1/2+1/2}.[107]

Ordering

[edit]
Log-log plot ofx + 1 andmax (x, 1) fromx = 0.001 to 1000[108]

The maximum operationmax(a,b){\displaystyle \max(a,b)} is a binary operation similar to addition. In fact, if two nonnegative numbersa{\displaystyle a} andb{\displaystyle b} are of differentorders of magnitude, their sum is approximately equal to their maximum. This approximation is extremely useful in the applications of mathematics, for example, in truncatingTaylor series. However, it presents a perpetual difficulty innumerical analysis, essentially since "max" is not invertible. Ifb{\displaystyle b} is much greater thana{\displaystyle a}, then a straightforward calculation of(a+b)b{\displaystyle (a+b)-b} can accumulate an unacceptableround-off error, perhaps even returning zero. See alsoLoss of significance.[60]

The approximation becomes exact in a kind of infinite limit; if eithera{\displaystyle a} orb{\displaystyle b} is an infinitecardinal number, their cardinal sum is exactly equal to the greater of the two.[d] Accordingly, there is no subtraction operation for infinite cardinals.[109]

Maximization is commutative and associative, like addition. Furthermore, since addition preserves the ordering of real numbers, addition distributes over "max" in the same way that multiplication distributes over addition:a+max(b,c)=max(a+b,a+c).{\displaystyle a+\max(b,c)=\max(a+b,a+c).}For these reasons, intropical geometry one replaces multiplication with addition and addition with maximization. In this context, addition is called "tropical multiplication", maximization is called "tropical addition", and the tropical "additive identity" isnegative infinity.[110] Some authors prefer to replace addition with minimization; then the additive identity is positive infinity.[111]

Tying these observations together, tropical addition is approximately related to regular addition through thelogarithm:log(a+b)max(loga,logb),{\displaystyle \log(a+b)\approx \max(\log a,\log b),}which becomes more accurate as the base of the logarithm increases.[112] The approximation can be made exact by extracting a constanth{\displaystyle h}, named by analogy with thePlanck constant fromquantum mechanics,[113] and taking the "classical limit" ash{\displaystyle h} tends to zero:max(a,b)=limh0hlog(ea/h+eb/h).{\displaystyle \max(a,b)=\lim _{h\to 0}h\log(e^{a/h}+e^{b/h}).}In this sense, the maximum operation is adequantized version of addition.[114]

In probability theory

[edit]

Convolution is used to add two independentrandom variables defined bydistribution functions. Its usual definition combines integration, subtraction, and multiplication.[115]

See also

[edit]

Notes

[edit]
  1. ^"Addend" is not a Latin word; in Latin it must be further conjugated, as innumerus addendus "the number to be added".
  2. ^For example,al-Khwarizmi performed multi-digit addition in this way from left to right.[43]
  3. ^This is according to a survey of the nations with highest TIMSS mathematics test scores.[62]
  4. ^Enderton calls this statement the "Absorption Law of Cardinal Arithmetic"; it depends on the comparability of cardinals and therefore on theAxiom of Choice.

Footnotes

[edit]
  1. ^Enderton (1977), p.138: "...select two setsK andL with cardK = 2 and cardL = 3. Sets of fingers are handy; sets of apples are preferred by textbooks."
  2. ^abcMusser, Peterson & Burger (2013), p. 87.
  3. ^Devine, Olson & Olson (1991), p. 263.
  4. ^Mazur (2014), p. 161.
  5. ^Department of the Army (1961),Section 5.1.
  6. ^Shmerko, Yanushkevich & Lyshevski (2009), p. 80;Schmid (1974);Schmid (1983).
  7. ^abSchwartzman (1994), p. 19.
  8. ^Schubert, Hermann (1903)."Monism in Arithmetic".Mathematical Essays and Recreations. Chicago: Open Court. p. 10.
  9. ^Karpinski (1925), pp. 56–57, reproduced on p. 104
  10. ^Schwartzman (1994), p. 212.
  11. ^Karpinski (1925), pp. 150–153.
  12. ^Lewis (1974), p. 1.
  13. ^Martin (2003), p. 49.
  14. ^Stewart (1999), p. 8.
  15. ^Apostol (1967), p. 37.
  16. ^SeeViro (2001) for an example of the sophistication involved in adding with sets of "fractional cardinality".
  17. ^National Research Council (2001), p. 74.
  18. ^Mosley (2001), p. 8.
  19. ^Li & Lappan (2014), p. 204.
  20. ^Musser, Peterson & Burger (2013), p. 89.
  21. ^Berg (1967), p. 14.
  22. ^Behr & Jungst (1971), p. 59.
  23. ^Rosen (2013), See theAppendix I.
  24. ^Posamentier et al. (2013), p. 71.
  25. ^abMusser, Peterson & Burger (2013), p. 90.
  26. ^Bronstein & Semendjajew (1987).
  27. ^Kaplan (2000), pp. 69–71.
  28. ^Hempel (2001), p. 7.
  29. ^Fierro (2012), Section 2.3.
  30. ^Moebs, William; et al. (2022). "1.4 Dimensional Analysis".University Physics Volume 1.OpenStax.ISBN 978-1-947172-20-3.
  31. ^Wynn (1998), p. 5.
  32. ^Wynn (1998), p. 15.
  33. ^Wynn (1998), p. 17.
  34. ^Wynn (1998), p. 19.
  35. ^Randerson, James (21 August 2008)."Elephants have a head for figures".The Guardian.Archived from the original on 2 April 2015. Retrieved29 March 2015.
  36. ^Smith (2002), p. 130.
  37. ^Carpenter, Thomas;Fennema, Elizabeth; Franke, Megan Loef; Levi, Linda;Empson, Susan (1999).Children's mathematics: Cognitively guided instruction. Portsmouth, NH: Heinemann.ISBN 978-0-325-00137-1.
  38. ^abHenry, Valerie J.; Brown, Richard S. (2008)."First-grade basic facts: An investigation into teaching and learning of an accelerated, high-demand memorization standard".Journal for Research in Mathematics Education.39 (2):153–183.doi:10.2307/30034895.JSTOR 30034895.
  39. ^Beckmann, S. (2014). The twenty-third ICMI study: primary mathematics study on whole numbers. International Journal of STEM Education, 1(1), 1–8.Chicago
  40. ^Schmidt, W., Houang, R., & Cogan, L. (2002). "A coherent curriculum".American Educator, 26(2), 1–18.
  41. ^abcdefgFosnot & Dolk (2001), p. 99.
  42. ^Some authors think that "carry" may be inappropriate for education;van de Walle (2004), p. 211 calls it "obsolete and conceptually misleading", preferring the word "trade". However, "carry" remains the standard term.
  43. ^Crossley & Henry (1990).
  44. ^Wingard-Nelson (2014), p. 40.
  45. ^Cassidy, David; Holton, Gerald; Rutherford, James (2002). "Reviewing Units, Mathematics, and Scientific Notation".Understanding Physics. New York: Springer. p. 11.doi:10.1007/0-387-21660-X_3.ISBN 978-0-387-98755-2.
  46. ^Dale R. Patrick, Stephen W. Fardo, Vigyan Chandra (2008)Electronic Digital System Fundamentals The Fairmont Press, Inc. p. 155
  47. ^P.E. Bates Bothman (1837)The common school arithmetic. Henry Benton. p. 31
  48. ^Truitt & Rogers (1960), pp. 1, 44–49, 2, 77–78.
  49. ^Gschwind & McCluskey (1975), p. 233.
  50. ^Ifrah, Georges (2001).The Universal History of Computing: From the Abacus to the Quantum Computer. New York: Wiley.ISBN 978-0-471-39671-0. p. 11
  51. ^Marguin (1994), p. 48. QuotingTaton (1963).
  52. ^Kistermann, F. W. (1998). "Blaise Pascal's adding machine: new findings and conclusions".IEEE Annals of the History of Computing.20 (1):69–76.Bibcode:1998IAHC...20a..69K.doi:10.1109/85.646211.
  53. ^Campanile, Benedetta (2024). "La girandola di Poleni: un progetto destinato a scomparire". In Di Mauro, Marco; Romano, Luigi; Zanini, Valeria (eds.).Atti del XLIII Convegno annuale SISFA (in Italian). pp. 151–158.doi:10.6093/978-88-6887-278-6.
  54. ^Flynn & Oberman (2001), pp. 2, 8.
  55. ^Flynn & Oberman (2001), pp. 1–9;Liu et al. (2010), p. 194.
  56. ^301 - Programmer's Reference Manual(PDF). January 1962. 93-17-000. RetrievedJuly 9, 2025.
  57. ^IBM 1620 Central Processing Unit, Model 1(PDF). Archived fromthe original(PDF) on 2017-10-09. Retrieved2017-12-18.
  58. ^Joshua Bloch,"Extra, Extra – Read All About It: Nearly All Binary Searches and Mergesorts are Broken"Archived 2016-04-01 at theWayback Machine. Official Google Research Blog, June 2, 2006.
  59. ^Neumann (1987).
  60. ^abGoldberg, David (March 1991)."What every computer scientist should know about floating-point arithmetic".ACM Computing Surveys.23 (1). Association for Computing Machinery (ACM):5–48.doi:10.1145/103162.103163.
  61. ^Enderton chapters 4 and 5, for example, follow this development.
  62. ^Schmidt, Houang & Cogan (2002), p. 4.
  63. ^Baez & Dolan (2001), p. 37 explains the historical development, in "stark contrast" with the set theory presentation: "Apparently, half an apple is easier to understand than a negative apple!"
  64. ^Begle (1975), p. 49;Johnson (1975), p. 120;Devine, Olson & Olson (1991), p. 75.
  65. ^Enderton (1977), p. 79.
  66. ^For a version that applies to any poset with thedescending chain condition, seeBergman (2005), p. 100
  67. ^Enderton (1977), p.79 observes, "But we want one binary operation+{\displaystyle +}, not all these little one-place functions."
  68. ^Ferreirós (1999), p. 223.
  69. ^Smith (1980), p. 234;Sparks & Rees (1979), p. 66.
  70. ^Campbell (1970), p. 83.
  71. ^Campbell (1970), p. 84.
  72. ^Enderton (1977), p. 92.
  73. ^abCameron & Craig (2013), p. 29.
  74. ^The verifications are carried out inEnderton (1977), p.104 and sketched for a general field of fractions over a commutative ring inDummit & Foote (1999), p. 263.
  75. ^Enderton (1977), p. 114.
  76. ^Ferreirós (1999), p. 135; see section 6 ofStetigkeit und irrationale ZahlenArchived 2005-10-31 at theWayback Machine.
  77. ^The intuitive approach, inverting every element of a cut and taking its complement, works only for irrational numbers; seeEnderton (1977), p.117 for details.
  78. ^Schubert, E. Thomas, Phillip J. Windley, and James Alves-Foss. "Higher Order Logic Theorem Proving and Its Applications: Proceedings of the 8th International Workshop, volume 971 of."Lecture Notes in Computer Science (1995).
  79. ^Textbook constructions are usually not so cavalier with the "lim" symbol; seeBurrill (1967), p. 138 for a more careful, drawn-out development of addition with Cauchy sequences.
  80. ^Ferreirós (1999), p. 128.
  81. ^Burrill (1967), p. 140.
  82. ^Conway, John B. (1986),Functions of One Complex Variable I, Springer,ISBN 978-0-387-90328-6
  83. ^Joshi, Kapil D (1989),Foundations of Discrete Mathematics, New York: Wiley,ISBN 978-0-470-21152-6
  84. ^Özhan (2022), p. 10.
  85. ^Gbur (2011), p. 1.
  86. ^Lipschutz, S., & Lipson, M. (2001). Schaum's outline of theory and problems of linear algebra. Erlangga.
  87. ^Riley, K.F.; Hobson, M.P.; Bence, S.J. (2010).Mathematical methods for physics and engineering. Cambridge University Press.ISBN 978-0-521-86153-3.
  88. ^Omondi (2020), p. 142.
  89. ^Princeton University Press (2008), p. 938.
  90. ^Pratt (2017), p. 314.
  91. ^Fenn, Roger (2012).Geometry. Springer Undergraduate Mathematics Series. Springer Science & Business Media. p. 42.ISBN 9781447103257.
  92. ^Nicholson (2012), p. 70;Bhattacharya, Jain & Nagpaul (1994), p. 159.
  93. ^Rieffel & Polak (2011), p. 16.
  94. ^Cheng (2017), pp. 124–132.
  95. ^Schindler (2014), p. 34.
  96. ^Riehl (2016), p. 100.
  97. ^Bhattacharya, Jain & Nagpaul (1994), p. 196.
  98. ^Kay (2021), p. 44.
  99. ^The set still must be nonempty.Dummit & Foote (1999), p. 48 discuss this criterion written multiplicatively.
  100. ^Musser, Peterson & Burger (2013), p. 101.
  101. ^Isoda, Olfos & Noine (2021), p. 163–164.
  102. ^Rudin (1976), p. 178.
  103. ^Lee (2003), p. 526, Proposition 20.9.
  104. ^Linderholm (1971), p. 49 observes, "Bymultiplication, properly speaking, a mathematician may mean practically anything. Byaddition he may mean a great variety of things, but not so great a variety as he will mean by 'multiplication'."
  105. ^Dummit & Foote (1999), p. 224. For this argument to work, one must assume that addition is a group operation and that multiplication has an identity.
  106. ^For an example of left and right distributivity, seeLoday (2002), p. 15.
  107. ^Shortt, Roy F.; Trueblood, Cecil R. (June 1969).Teacher's Handbook; Elementary School Mathematics. Parts I and II(PDF). Pennsylvania State University Computer-Assisted Instruction Lab. pp. 52, 59.
  108. ^CompareViro (2001), p. 2, Figure 1.
  109. ^Enderton (1977), p. 164.
  110. ^Mikhalkin (2006), p. 1.
  111. ^Akian, Bapat & Gaubert (2005), p. 4.
  112. ^Mikhalkin (2006), p. 2.
  113. ^Litvinov, Maslov & Sobolevskii (1999), p. 3.
  114. ^Viro (2001), p. 4.
  115. ^Gbur (2011), p. 300.

References

[edit]

Further reading

[edit]
Hyper-operators:
Bowers's extensions:
  • Expansion (muiti/power/expando)
  • Explosion (multi/power/expando)
  • Detonation (multi/power)
  • Pentonation (multi)
Username's extensions:
  • Hexonation
  • Heptonation
  • Octonation
  • Ennonation
  • Dekonation
Tiaokhiao's extensions:
  • Megotion (muiti/power/tetra)
  • Megoexpansion (multi/power)
  • Megoexplosion (multi)
  • Megodetonation
  • Gigotion (expand/explod/deto)
  • Terotion (expand)
  • Petotion
  • Exotion
  • Zettotion
  • Yottotion
Saibian's extensions:
  • Powiaination (expand/explod/deto)
  • Megodaination (expand/explod)
  • Gigodaination (expand)
  • Terodaination
  • Powiairation (megod/gigod/terod)
  • Powiaintation (megod)
  • Powiairtation
International
National
Other
Retrieved from "https://en.wikipedia.org/w/index.php?title=Addition&oldid=1322889059"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp