Jump to content

Arithmetic: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
→‎Sources: refbegin-end
rearranged contents in section "Number theory" and expanded a little; added sources; adjusted text to match them; for earlier drafts, see User:Phlsph7/Arithmetic number theory
Line 319: Line 319:
The cumbersome nature of compound unit arithmetic has been recognized for many years—in 1586, the Flemish mathematician [[Simon Stevin]] published a small pamphlet called ''[[De Thiende]]'' ("the tenth")<ref>{{MacTutor|id=Stevin|date=January 2004}}</ref> in which he declared the universal introduction of decimal coinage, measures, and weights to be merely a question of time. In the modern era, many conversion programs, such as that included in the Microsoft Windows&nbsp;7 operating system calculator, display compound units in a reduced decimal format rather than using an expanded format (e.g., "2.5&nbsp;ft" is displayed rather than {{nowrap|"2 ft 6 in"}}).
The cumbersome nature of compound unit arithmetic has been recognized for many years—in 1586, the Flemish mathematician [[Simon Stevin]] published a small pamphlet called ''[[De Thiende]]'' ("the tenth")<ref>{{MacTutor|id=Stevin|date=January 2004}}</ref> in which he declared the universal introduction of decimal coinage, measures, and weights to be merely a question of time. In the modern era, many conversion programs, such as that included in the Microsoft Windows&nbsp;7 operating system calculator, display compound units in a reduced decimal format rather than using an expanded format (e.g., "2.5&nbsp;ft" is displayed rather than {{nowrap|"2 ft 6 in"}}).


==Number theory==
== Number theory ==
{{main|Number theory}}
{{main|Number theory}}

Until the 19th century, ''number theory'' was a synonym of "arithmetic". The addressed problems were directly related to the basic operations and concerned [[prime number|primality]], [[divisibility]], and the [[Diophantine equation|solution of equations in integers]], such as [[Fermat's Last Theorem]]. It appeared that most of these problems, although very elementary to state, are very difficult and may not be solved without very deep mathematics involving concepts and methods from many other branches of mathematics. This led to new branches of number theory such as [[analytic number theory]], [[algebraic number theory]], [[Diophantine geometry]] and [[arithmetic algebraic geometry]]. [[Wiles' proof of Fermat's Last Theorem]] is a typical example of the necessity of sophisticated methods, which go far beyond the classical methods of arithmetic, for solving problems that can be stated in elementary arithmetic.
Number theory studies the structure and properties of integers as well as the relations and laws between them.{{sfn|EoM staff|2016}}{{sfn|Grigorieva|2018|pp=[https://books.google.com/books?id=mEpjDwAAQBAJ&pg=PR8 viii–ix]}}{{sfn|Page|2003|p=[https://www.sciencedirect.com/science/article/abs/pii/B0122274105005032 15]}} Some of the main branches of modern number theory include [[elementary number theory]], [[analytic number theory]], [[algebraic number theory]], and [[geometric number theory]].{{sfn|Page|2003|p=[https://www.sciencedirect.com/science/article/abs/pii/B0122274105005032 34]}}{{sfn|Yan|2013|p=12}} Elementary number theory studies aspects of integers that can be investigated using elementary methods. In this regard, it excludes the use of methodes found in [[analysis]] and [[calculus]]. Its topics include [[divisibility]], [[factorization]], and [[prime number|primality]].{{sfn|Page|2003|pp=[https://www.sciencedirect.com/science/article/abs/pii/B0122274105005032 18–19, 34]}}{{sfn|EoM staff|2014a}} Analytic number theory, by contrast, relies on techniques from analysis and calculus. It examines problems like [[prime number theorem|how prime numbers are distributed]] and the claim that [[Goldbach's conjecture|every even number is a sum of two prime numbers]].{{sfn|Page|2003|p=[https://www.sciencedirect.com/science/article/abs/pii/B0122274105005032 34]}}{{sfn|EoM staff|2014}} Algebraic number theory employs algebraic structures to analyze the properties of and relations between numbers. Examples are the use of [[Field (mathematics)|fields]] and [[Ring (mathematics)|rings]], as in [[algebraic number field]]s like the [[ring of integers]]. Geometric number theory uses concepts from geometry to study numbers. For instance, it investigates how lattice points with integer coordinates behave in a plane.{{sfn|Page|2003|pp=[https://www.sciencedirect.com/science/article/abs/pii/B0122274105005032 34–35]}}{{sfn|EoM staff|2019}} Further branches of number theory are [[probabilistic number theory]], [[combinatorial number theory]], [[computational number theory]], and applied number theory.{{sfn|Yan|2013|p=12}}{{sfn|Yan|2013|p=[https://books.google.com/books?id=74oBi4ys0UUC&pg=PA15 15]}}

Influential theorems in number theory include the [[fundamental theorem of arithmetic]], [[Euclid's theorem]], and [[Fermat's last theorem]].{{sfn|EoM staff|2016}}{{sfn|Křížek|Somer|Šolcová|2021|pp=[https://books.google.com/books?id=tklEEAAAQBAJ&pg=PA23 23, 25, 37]}} According to the fundamental theorem of arithmetic, every integer greater than 1 is either a prime number or can be represented as a unique product of prime numbers. For example, the [[18 (number)|number 18]] is not a prime number and can be represented as <math>2 \times 3 \times 3</math>, all of which are prime numbers. The [[19 (number)|number 19]], by contrast, is a prime number that has no other prime factorization.{{sfn|Křížek|Somer|Šolcová|2021|p=[https://books.google.com/books?id=tklEEAAAQBAJ&pg=PA23 23]}}{{sfn|Riesel|2012|p=[https://books.google.com/books?id=ITvaBwAAQBAJ&pg=PA2 2]}} Euclid's theorem states that there are infinitely many prime numbers.{{sfn|EoM staff|2016}}{{sfn|Křížek|Somer|Šolcová|2021|p=[https://books.google.com/books?id=tklEEAAAQBAJ&pg=PA25 25]}} Fermat's last theorem is the statement that no integer values can be found for <math>a</math>, <math>b</math>, and <math>c</math>, to solve the equation <math>a^n + b^n = c^n</math> if <math>n</math> is greater than <math>2</math>.{{sfn|EoM staff|2016}}{{sfn|Křížek|Somer|Šolcová|2021|p=[https://books.google.com/books?id=tklEEAAAQBAJ&pg=PA37 37]}}


==Arithmetic in education==
==Arithmetic in education==
Line 503: Line 506:
* {{cite web |last1=MacDuffee |first1=C. C. |title=Arithmetic |url=https://www.britannica.com/science/arithmetic |website=Encyclopedia Britannica |access-date=18 November 2023 |language=en}}
* {{cite web |last1=MacDuffee |first1=C. C. |title=Arithmetic |url=https://www.britannica.com/science/arithmetic |website=Encyclopedia Britannica |access-date=18 November 2023 |language=en}}
* {{cite book |last1=Adamowicz |first1=Zofia |editor1-last=Joseph |editor1-first=Anthony |editor2-last=Mignot |editor2-first=Fulbert |editor3-last=Murat |editor3-first=François |editor4-last=Prum |editor4-first=Bernard |editor5-last=Rentschler |editor5-first=Rudolf |title=First European Congress of Mathematics: Paris, July 6-10, 1992 Volume I Invited Lectures (Part 1) |date=1994 |publisher=Birkhäuser |isbn=978-3-0348-9110-3 |url=https://link.springer.com/chapter/10.1007/978-3-0348-9110-3_9 |language=en |chapter=The Power of Exponentiation in Arithmetic}}
* {{cite book |last1=Adamowicz |first1=Zofia |editor1-last=Joseph |editor1-first=Anthony |editor2-last=Mignot |editor2-first=Fulbert |editor3-last=Murat |editor3-first=François |editor4-last=Prum |editor4-first=Bernard |editor5-last=Rentschler |editor5-first=Rudolf |title=First European Congress of Mathematics: Paris, July 6-10, 1992 Volume I Invited Lectures (Part 1) |date=1994 |publisher=Birkhäuser |isbn=978-3-0348-9110-3 |url=https://link.springer.com/chapter/10.1007/978-3-0348-9110-3_9 |language=en |chapter=The Power of Exponentiation in Arithmetic}}
* {{cite book |last1=Yan |first1=Song Y. |title=Number Theory for Computing |date=9 March 2013 |publisher=Springer Science & Business Media |isbn=978-3-662-04053-9 |url=https://books.google.com/books?id=X8aqCAAAQBAJ |language=en}}
* {{cite book |last1=Grigorieva |first1=Ellina |title=Methods of Solving Number Theory Problems |date=6 July 2018 |publisher=Birkhäuser |isbn=978-3-319-90915-8 |url=https://books.google.com/books?id=mEpjDwAAQBAJ&pg=PR8 |language=en}}
* {{cite book |last1=Page |first1=Robert L. |title=Encyclopedia of Physical Science and Technology (Third Edition) |date=1 January 2003 |publisher=Academic Press |isbn=978-0-12-227410-7 |url=https://www.sciencedirect.com/science/article/abs/pii/B0122274105005032 |chapter=Number Theory, Elementary}}
* {{cite book |last1=Křížek |first1=Michal |last2=Somer |first2=Lawrence |last3=Šolcová |first3=Alena |title=From Great Discoveries in Number Theory to Applications |date=21 September 2021 |publisher=Springer Nature |isbn=978-3-030-83899-7 |url=https://books.google.com/books?id=tklEEAAAQBAJ&pg=PA23 |language=en}}
* {{cite web |author1=EoM staff |title=Analytic number theory |url=https://encyclopediaofmath.org/wiki/Analytic_number_theory |website=Encyclopedia of Mathematics |publisher=Springer |access-date=23 October 2023 |date=2014}}
* {{cite web |author1=EoM staff |title=Algebraic number theory |url=https://encyclopediaofmath.org/wiki/Algebraic_number_theory |website=Encyclopedia of Mathematics |publisher=Springer |access-date=23 October 2023 |date=2019}}
* {{cite web |author1=EoM staff |title=Elementary number theory |url=https://encyclopediaofmath.org/wiki/Elementary_number_theory |website=Encyclopedia of Mathematics |publisher=Springer |access-date=23 October 2023 |date=2014a}}
* {{cite book |last1=Riesel |first1=Hans |title=Prime Numbers and Computer Methods for Factorization |date=6 December 2012 |publisher=Springer Science & Business Media |isbn=978-1-4612-0251-6 |url=https://books.google.com/books?id=ITvaBwAAQBAJ&pg=PA2 |language=en}}
* {{cite book |last1=Yan |first1=Song Y. |title=Computational Number Theory and Modern Cryptography |date=29 January 2013 |publisher=John Wiley & Sons |isbn=978-1-118-18858-3 |url=https://books.google.com/books?id=74oBi4ys0UUC&pg=PA15 |language=en}}
{{refend}}
{{refend}}



Revision as of 14:46, 19 November 2023

Arithmetic tables for children, Lausanne, 1835

Arithmetic (from Ancient Greek ἀριθμός (arithmós) 'number', and τική [τέχνη] (tikḗ [tékhnē]) 'art, craft') is an elementary part of mathematics that consists of the study and use of the traditional operations on numbers: addition, subtraction, multiplication, and division. It can also be regarded as including exponentiation, extraction of roots, and taking logarithms. Types of numbers manipulated in arithmetic include the natural numbers, which are used to count quantities; integers, which include the negative counterparts of the positive natural numbers 1, 2, 3, ...; fractions or rational numbers, which can fall in between the integers; and all of the other real numbers, which together form the complete number line. Arithmetic can be applied in even wider contexts, like the complex numbers.

The practice of arithmetic is at least thousands and possibly tens of thousands of years old. Ancient civilizations including the Egyptian and Sumerian used arithmetic to solve practical problems, and Euclid's Elements records early results in number theory, the exploration of numbers in the abstract. Much of the work on the logical foundation of arithmetic dates to the 19th century, and the implementation of arithmetic operations on electronic computers became a major concern during the 20th. There yet remain questions about arithmetic whose answers are unknown.

Definition, etymology, and related fields

Arithmetic is the fundamental branch of mathematics that studies numbers and their operations. In particular, it deals with numerical calculations using the arithmetic operations of addition, subtraction, multiplication, and division.[1][2][3][4] In a wider sense, it also includes exponentiation, extraction of roots, and logarithm.[4][5][6][7] The term "arithmetic" has its root in the Latin term "arithmetica" which derives from the Ancient Greek words ἀριθμός (arithmos), meaning "number", and ἀριθμητική τέχνη (arithmetike tekhne), meaning "the art of counting".[8][9][10]

There are disagreements about its precise definition. According to a narrow characterization, arithmetic deals only with natural numbers.[11][12] However, the more common view is to include operations on integers, rational numbers, real numbers, and sometimes also complex numbers in its scope.[1][2][3][4] Some definitions restrict arithmetic to the field of numerical calculations.[13] When understood in a wider sense, it also includes the study of how the concept of numbers developed, the analysis of properties of and relations between numbers, and the examination of the axiomatic structure of arithmetic operations.[4][14][15]

Arithmetic is closely related to number theory and some authors use the terms as synonyms.[16][17] However, in a more specific sense, number theory is restricted to the study of integers and focuses on their properties and relationships such as divisibility, factorization, and primality.[18][19][20][21] Traditionally, it is known as higher arithmetic.[22][21]

Arithmetic is intimately connected to many branches of mathematics that depend on numerical operations. Algebra relies on arithmetic principles to solve equations using variables. These principles also play a key role in calculus in its attempt to determine rates of change and areas under curves. Geometry uses arithmetic operations to measure the properties of shapes while statistics utilizes them to analyze numerical data.[23][24][25][26]

Numbers

Numbers are mathematical objects used to count quantities and measure magnitudes. They are fundamental elements in arithmetic since all arithmetic operations are performed on numbers. There are different types of numbers and different numeral systems to represent them.[27][28][29]

Types

Number line showing different types of numbers
Different types of numbers on a number line. Integers are black, rational numbers are blue, and irrational numbers are green.

The main types of numbers employed in arithmetic are natural numbers, whole numbers, integers, rational numbers, and real numbers.[30][31][28] The natural numbers are whole numbers that start from 1 and go to infinity. They exclude 0 and negative numbers. They are also known as counting numbers and can be expressed as {1, 2, 3, 4, ...}. The symbol of the natural numbers is . The whole numbers are identical to the natural numbers with the only difference being that they include 0. They can be represented as {0, 1, 2, 3, 4, ...} and have the symbol .[32][30][33][34] Some mathematicians do not draw the distinction between the natural and the whole numbers by including 0 in the set of natural numbers.[35][36] The set of integers encompasses both positive and negative whole numbers. It has the symbol and can be expressed as {..., -2, -1, 0, 1, 2, ...}.[32][30][33][37]

A number is rational if it can be represented as the ratio of two integers. For example, the rational number is formed by dividing the integer 1, called the numerator, by the integer 2, called the denominator. Other examples are and . The set of rational numbers includes all integers, which are fractions with a denominator of 1. The symbol of the rational numbers is .[32][30][33][38] Decimal fractions like 0.3 and 25.12 are a special type of rational numbers since their denominator is a power of 10. For example, 0.3 is equal to , and 25.12 is equal to .[39][40] Every rational number corresponds to a finite or a repeating decimal.[41]

Irrational numbers are numbers that cannot be expressed through the ratio of two integers. Examples are many square roots, such as , and numbers like π and e (Euler's number).[32][30][33] The decimal representation of an irrational number is infinite without repeating decimals.[42][43] The set of rational numbers together with the set of irrational numbers makes up the set of real numbers. The symbol of the real numbers is .[32][33] Even wider classes of numbers include complex numbers and quaternions.[33][44]

Based on how numbers are used, they can be distinguished into cardinal and ordinal numbers. Cardinal numbers, like one, two, and three, are numbers that express the quantity of objects. They answer the question "how many?". Ordinal numbers, such as first, second, and third, indicate order or placement in a series. They answer the question "what position?".[45][46]

Numeral systems

A numeral is a symbol to represent a number and numeral systems are representational frameworks.[47][48][49] They usually have a limited amount of basic numerals, which directly refer to certain numbers. The system governs how these basic numerals may be combined to express any number.[50][51] Numeral systems are either positional or non-positional. All early numeral systems were non-positional.[52][53][54] For non-positional numeral systems, the value of a digit does not depend on its position in the numeral.[53][54]

Diagram showing tally marks
Photo of tally sticks
Tally marks and some tally sticks use the non-positional unary numeral system.

The simplest non-positional system is the unary numeral system. It relies on one symbol for the number 1. All higher numbers are written by repeating this symbol. For example, the number 7 can be represented by repeating the symbol for 1 seven times. This system makes it cumbersome to write large numbers, which is why many non-positional systems include additional symbols to directly represent larger numbers.[50][55][56] Variations of the unary numeral systems are employed in tally sticks using dents and in tally marks.[57][58]

Table showing different ways to write the Egyptian numerals
Table showing different ways to write the Egyptian numerals

Egyptian hieroglyphics had a more complex non-positional numeral system. They have additional symbols for numbers like 10, 100, 1000, and 10,000. These symbols can be combined into a sum to more conveniently express larger numbers. For example, the numeral for 10,405 uses one time the symbol for 10,000, four times the symbol for 100, and five times the symbol for 1. A similar well-known framework is the Roman numeral system. It has the symbols I, V, X, L, C, D, M as its basic numerals to represent the numbers 1, 5, 10, 50, 100, 500, and 1000.[50][55][59]

A numeral system is positional if the position of a basic numeral in a compound expression determines its value. Positional numeral systems have a radix that acts as a multiplier of the different positions. For each subsequent position, the radix is raised to a higher power. In the common decimal system, also called the Hindu–Arabic numeral system, the radix is 10. This means that the first digit is multiplied by , the next digit is multiplied by , and so on. For example, the decimal numeral 532 stands for . Because of the effect of the digits' positions, the numeral 532 differs from the numerals 325 and 253 even though they have the same digits.[60][61][62][63][54]

Another positional numeral system used extensively in computer arithmetic is the binary system, which has a radix of 2. This means that the first digit is multiplied by , the next digit by , and so on. For example, the number 13 is written as 1101 in the binary notation, which stands for . In computing, each digit in the binary notation is corresponds to one bit.[64][65][66] The earliest positional system was developed by ancient Babylonians and had a radix of 60.[67]

Arithmetic operations

Arithmetic operations are ways of combining, transforming, or manipulating numbers. They are functions that have numbers both as input and output.[68][69][70] The most important operations in arithmetic are addition, subtraction, multiplication, and division.[71][4][72] Further operations include exponentiation, extraction of roots, and logarithm.[4][6][5][7][72] If these operations are performed on variables rather than numbers, they are sometimes referred to as algebraic operations.[73][74]

Two important concepts in relation to arithmetic operations are identity elements and inverse elements. The identity element or neutral element of an operation does not cause any change if it is applied to another element. For example, the identity element of addition is 0 since any sum of a number and 0 results in the same number. The inverse element is the element that results in the identity element when combined with another element. For instance, the additive inverse of the number 6 is -6 since their sum is 0.[75][76][77]

There are not only inverse elements but also inverse operations. In an informal sense, one operation is the inverse of another operation if it undoes the first operation. For example, subtraction is the inverse of addition since a number returns to its original value if a second number is first added and subsequently subtracted, as in . Defined more formally, the operation "" is an inverse of the operation "" if it fulfills the following condition: if and only if .[78][79]

Commutativity and associativity are laws governing the order in which some arithmetic operations can be carried out. An operation is commutative if the order of the arguments can be changed without affecting the results. This is the case for addition, for example, is the same as . Associativity is a rule that affects the order in which a series of operations can be carried out. An operation is associative if in a series of two operations, it does not matter which operation is carried out first. This is the case for multiplication, for example, since is the same as .[77][76]

Addition and subtraction

Diagram showing addition
Diagram showing subtraction
Addition and subtraction

Addition is an arithmetic operation in which two numbers, called the addends, are combined into a single number, called the sum. The symbol of addition is . Examples are and .[80][60] The term summation is used if several additions are performed in a row. Counting is a type of repeated addition in which the number 1 is continuously added.[81]

Subtraction is the inverse of addition. In it, one number, known as the subtrahend, is taken away from another, known as the minuend. The result of this operation is called the difference. The symbol of subtraction is .[60][82][78][79] Examples are and . Subtraction is often treated as a special case of addition: instead of subtracting a positive number, it is also possible to add a negative number. For instance . This helps to simplify mathematical computations by reducing the number of basic arithmetic operations needed to perform calculations.[83][84][85]

The additive identity element is 0 and the additive inverse of a number is the negative of that number. For example, and . Addition is both commutative and associative.[76][60][86]

Multiplication and division

Diagram showing multiplication
Diagram showing division
Multiplication and division

Multiplication is an arithmetic operation in which two numbers, called the multiplier and the multiplicant, are combined into a single number called the product.[60][87] The symbols of multiplication are , , and *. Examples are and . If the multiplicant is a natural number then multiplication is the same as repeated addition, as in .[32][79][87]

Division is the inverse of multiplication. In it, one number, known as the dividend, is split into several equal parts by another number, known as the divisor. The result of this operation is called the quotient. The symbols of division are and . Examples are and .[60][83][79] Division is often treated as a special case of multiplication: instead of dividing by a number, it is also possible to multiply by its reciprocal. The reciprocal of a number is 1 divided by that number. For instance, .[88][83][84]

The multiplicative identity element is 1 and the multiplicative inverse of a number is the reciprocal of that number. For example, and . Multiplication is both commutative and associative.[76][15][86]

Exponentiation and logarithm

Diagram showing exponentiation
Diagram showing logarithm
Exponentiation and logarithm

Exponentiation is an arithmetic operation in which a number, known as the base, is raised to the power of another number, known as the exponent. The result of this operation is called the power. Exponentiation is sometimes expressed using the symbol ^ but the more common way is to write the exponent in superscript right after the base. Examples are and ^. If the exponent is a natural number then exponentiation is the same as repeated multiplication, as in .[89][90]

Roots are a special type of exponentiation using a fractional exponent. For example, the square root of a number is the same as raising the number to the power of and the cube root of a number is the same as raising the number to the power of . Examples are and .[91][92]

Logarithm is the inverse of exponentiation. In it, the base and the argument of the logarithm are used to determine the power to which the base must be raised to produce the argument. The result of this operation is known as the anti-logarithm. For example, to determine the logarithm of 16 in relation to the base 2, it is necessary to find what exponent should be used on the base 2 for the result to be 16. The anti-logarithm of this operation is 4 since 2 raised by 4 results in 16.[93][94]

Exponentiation and logarithm do not have general identity elements and inverse elements like addition and multiplication. The neutral element of exponentiation in relation to the exponent is 1, as in . However, exponentiation does not have a general identity element since 1 is not the neutral element for the base.[88][76] Exponentiation and logarithm are neither commutative nor associative.[95][96]

Integer arithmetic

Integer arithmetic is the branch of arithmetic that deals with the manipulation of positive and negative whole numbers.[32][33][37] Simple one-digit operations can be performed by following or memorizing a table that presents the results of all possible combinations, like an addition table or a multiplication table. Other common methods are verbal counting and finger-counting.[97][98][99]

Addition table
+ 0 1 2 3 4 ...
0 0 1 2 3 4 ...
1 1 2 3 4 5 ...
2 2 3 4 5 6 ...
3 3 4 5 6 7 ...
4 4 5 6 7 8 ...
... ... ... ... ... ... ...
Multiplication table
× 0 1 2 3 4 ...
0 0 0 0 0 0 ...
1 0 1 2 3 4 ...
2 0 2 4 6 8 ...
3 0 3 6 9 12 ...
4 0 4 8 12 16 ...
... ... ... ... ... ... ...
Diagram of addition with carry
Example of addition with carry. The black numbers are the addends, the green number is the carry, and the blue number is the sum.

For operations on numbers with more than one digit, different techniques can be employed to calculate the result by using several one-digit operations in a row. For example, in the method addition with carries, the two numbers are written one above the other. Starting from the rightmost digit, each pair of digits is added together. The rightmost digit of the sum is written below them. If the sum is a two-digit number then the leftmost digit, called the "carry", is added to the next pair of digits to the left. This process is repeated until all digits have been added.[100][101] Other methods used for integer additions are the number line method, the partial sum method, and the compensation method.[102][103] A similar technique is used for subtraction: it also starts with the rightmost digit and uses a "borrow" or a negative carry for the column on the left if the result of the one-digit subtraction is negative.[104]

Diagram of long multiplication
Example of long multiplication. The black numbers are the multiplicand and the multiplier. The green numbers are intermediary products gained by multiplying the multiplicant with only one digit of the multiplier. The blue number is the total product calculated by adding the intermediary products.

A basic technique of integer multiplication uses repeated addition. For example, the product of 3 × 4 can be calculated as 3 + 3 + 3 + 3.[105] A common technique for multiplication with larger numbers is called long multiplication. This method starts by writing the multiplicand above the multiplier. The calculation begins by multiplying the multiplicand only with the rightmost digit of the multiplier and writing the result below, starting in the rightmost column. The same is done for each digit of the multiplier and the result in each case is shifted one position to the left. As a final step, all the individual products are added to arrive at the total product of the two multi-digit numbers.[106][107] Other techniques used for multiplication are the grid method and the lattice method.[108] Computer science is interested in multiplication algorithms with a low computational complexity to be able to efficiently multiply very large integers, such as the Karatsuba algorithm, the Schönhage-Strassen algorithm, and the Toom-Cook algorithm.[109][110] A common technique used for division is called long division. Other methods include short division and chunking.[111]

Integer arithmetic is not closed under division. This means that when dividing one integer by another integer, the result is not always an integer. For example, 7 divided by 2 is not a whole number but 3.5.[112] One way to ensure that the result is an integer is to round the result to a whole number. However, this method leads to inaccuracies as the original value is altered.[113] Another method is to perform the division only partially and retain the remainder. For example, 7 divided by 2 is 3 with a remainder of 1. These difficulties are avoided by rational arithmetic, which allows for the exact representation of fractions.[114]

A simple method to calculate exponentiation is by repeated multiplication. For example, the exponentiation of 34 can be calculated as 3 × 3 × 3 × 3.[115] A more efficient technique used for large exponents is exponentiation by squaring. It breaks down the calculation into a number of squaring operations. For example, the exponentiation 365 can be written as (((((32)2)2)2)2)2 × 3. By taking advantage of repeated squaring operations, only 7 individual operations are needed rather than the 64 operations required for regular repeated multiplication.[116][117] Methods to calculate logarithms include the Taylor series and continued fractions.[118][119] Integer arithmetic is not closed under logarithm and under exponentiation with negative exponents, meaning that the result of these operations is not always an integer.[120][118]

Rational arithmetic

Rational arithmetic is the branch of arithmetic that deals with the manipulation of numbers that can be expressed as a ratio of two integers.[121][32][33][38] Most arithmetic operations on rational numbers can be calculated by performing a series of integer arithmetic operations on the numerators and the denominators of the involved numbers. If two rational numbers have the same denominator then they can be added by adding their numerators and keeping the common denominator. For example, . A similar procedure is used for subtraction. If the two numbers do not have the same denominator then they must be transformed to find a common denominator. This can be achieved by scaling the first number with the denominator of the second number while scaling the second number with the denominator of the first number. For example, .[122][123]

Two rational numbers are multiplied by multiplying their numerators and their denominators respectively, as in . Dividing one rational number by another can be achieved by multiplying the first number with the reciprocal of the second number. This means that the numerator and the denominator of the second number change position. For example, .[124] Unlike integer arithmetic, rational arithmetic is closed under division as long as the divisor is not 0.[40]

Both integer arithmetic and rational arithmetic are not closed under exponentiation and logarithm.[125] One way to calculate exponentiation with a fractional exponent is to perform two separate calculations: one exponentiation using the numerator of the exponent followed by drawing the nth root of the result based on the denominator of the exponent. For example, . The first operation can be completed using methods like repeated multiplication or exponentiation by squaring. One way to get an approximate result for the second operation is to employ Newton's method, which uses a series of steps to gradually refine an initial guess until it reaches the desired level of accuracy.[126][127][128] The Taylor series or the continued fraction method can be used to calculate logarithms.[118][119]

The decimal fraction notation is a special way of representing rational numbers whose denominator is a power of 10. For example, the rational numbers , , and are written as 0.1, 3.71, and 0.0044 in the decimal fraction notation.[40][129] Modified versions of integer calculation methods like addition with carry and long multiplication can be applied to calculations with decimal fractions.[130][131] Not all rational numbers have an finite representation in the decimal notation. For example, the rational number corresponds 0.333... with an infinite number of 3s. The shortened notation for this type of repeating decimal is 0.3.[132][129] Every repeating decimal expresses a rational number.[41]

Real arithmetic

Real arithmetic is the branch of arithmetic that deals with the manipulation of both rational and irrational numbers. Irrational numbers are numbers that cannot be expressed through fractions or repeated decimals, like the root of 2 and π.[42][133][43][134] Unlike rational arithmetic, real arithmetic is closed under exponentiation as long as it uses a positive number as its base. The same is true for the logarithm of positive real numbers as long as the logarithm base is positive and not 1.[135][136][137]

Irrational numbers involve an infinite non-repeating series of decimal digits. Because of this, there is often no simple and accurate way to express the results of arithmetic operations like or . [42][133][43][134] In cases where absolute precision is not required, the problem of calculating arithmetic operations on real numbers is usually addressed by truncation or rounding. For truncation, a certain number of significant digits to the left are kept and additional digits to the right of the last significant digit are removed. For example, the number π has an infinite number of digits starting with 3.14159... . If this number is truncated to 4 significant digits, the result is 3.141. Rounding is a similar process in which the last significant digit is increased by one if the next digit is 5 or greater. If the next digit is less than 5, the last digit remains the same. For example, if the number π is rounded to 4 significant digits, the result is 3.142 because the following digit is a 5.[138][139][140] These methods are essential to allow computers to efficiently perform calculations on real numbers.[141]

Very large and very small real numbers are often expressed using normalized scientific notation. In it, numbers are represented using a so-called significand multiplied by a power of 10. The significand is a digit followed by a decimal point and a series of digits. For example, the normalized scientific notation of the number 8276000 is and the number 0.00735 has the normalized scientific notation of .[142][143]

A common method employed by computers to approximate real arithmetic is called floating-point arithmetic. It represents real numbers similar to the scientific notation through three numbers: a significand, a base, and an exponent.[144] The precision of the significand is limited by the number of bits allocated to represent it. If an arithmetic operation results in a number that requires more bits than are available, the computer rounds the result to the closest representable number. This leads to rounding errors.[141][144][145] A consequence of this behavior is that certain laws of arithmetic are violated by floating-point arithmetic. For example, floating-point addition is not associative since the rounding errors introduced can depend on the order of the additions. This means that the result of is sometimes different from the result of .[146][147] The most common technical standard used for floating-point arithmetic is called IEEE 754. Among other things, it determines how numbers are represented, how arithmetic operations and rounding are performed, and how errors and exceptions are handled.[148][149][150]

Decimal arithmetic

Decimal representation refers exclusively, in common use, to the written numeral system employing arabic numerals as the digits for a radix 10 ("decimal") positional notation; however, any numeral system based on powers of 10, e.g., Greek, Cyrillic, Roman, or Chinese numerals may conceptually be described as "decimal notation" or "decimal representation".

Modern methods for four fundamental operations (addition, subtraction, multiplication and division) were first devised by Brahmagupta of India. This was known during medieval Europe as "Modus Indorum" or Method of the Indians. Positional notation (also known as "place-value notation") refers to the representation or encoding of numbers using the same symbol for the different orders of magnitude (e.g., the "ones place", "tens place", "hundreds place") and, with a radix point, using those same symbols to represent fractions (e.g., the "tenths place", "hundredths place"). For example, 507.36 denotes 5 hundreds (102), plus 0 tens (101), plus 7 units (100), plus 3 tenths (10−1) plus 6 hundredths (10−2).

The concept of 0 as a number comparable to the other basic digits is essential to this notation, as is the concept of 0's use as a placeholder, and as is the definition of multiplication and addition with 0. The use of 0 as a placeholder and, therefore, the use of a positional notation is first attested to in the Jain text from India entitled the Lokavibhâga, dated 458 AD and it was only in the early 13th century that these concepts, transmitted via the scholarship of the Arabic world, were introduced into Europe by Fibonacci[151] using the Hindu–Arabic numeral system.

Algorism comprises all of the rules for performing arithmetic computations using this type of written numeral. For example, addition produces the sum of two arbitrary numbers. The result is calculated by the repeated addition of single digits from each number that occupies the same position, proceeding from right to left. An addition table with ten rows and ten columns displays all possible values for each sum. If an individual sum exceeds the value 9, the result is represented with two digits. The rightmost digit is the value for the current position, and the result for the subsequent addition of the digits to the left increases by the value of the second (leftmost) digit, which is always one (if not zero). This adjustment is termed a carry of the value 1.

The process for multiplying two arbitrary numbers is similar to the process for addition. A multiplication table with ten rows and ten columns lists the results for each pair of digits. If an individual product of a pair of digits exceeds 9, the carry adjustment increases the result of any subsequent multiplication from digits to the left by a value equal to the second (leftmost) digit, which is any value from 1 to 8 (9 × 9 = 81). Additional steps define the final result.

Similar techniques exist for subtraction and division.

The creation of a correct process for multiplication relies on the relationship between values of adjacent digits. The value for any single digit in a numeral depends on its position. Also, each position to the left represents a value ten times larger than the position to the right. In mathematical terms, the exponent for the radix (base) of 10 increases by 1 (to the left) or decreases by 1 (to the right). Therefore, the value for any arbitrary digit is multiplied by a value of the form 10n with integer n. The list of values corresponding to all possible positions for a single digit is written as {..., 102, 10, 1, 10−1, 10−2, ...}.

Repeated multiplication of any value in this list by 10 produces another value in the list. In mathematical terminology, this characteristic is defined as closure, and the previous list is described as closed under multiplication. It is the basis for correctly finding the results of multiplication using the previous technique. This outcome is one example of the uses of number theory.

Compound unit arithmetic

Compound[152] unit arithmetic is the application of arithmetic operations to mixed radix quantities such as feet and inches; gallons and pints; pounds, shillings and pence; and so on. Before decimal-based systems of money and units of measure, compound unit arithmetic was widely used in commerce and industry.

Basic arithmetic operations

The techniques used in compound unit arithmetic were developed over many centuries and are well documented in many textbooks in many different languages.[153][154][155][156] In addition to the basic arithmetic functions encountered in decimal arithmetic, compound unit arithmetic employs three more functions:

  • Reduction, in which a compound quantity is reduced to a single quantity—for example, conversion of a distance expressed in yards, feet and inches to one expressed in inches.[157]
  • Expansion, the inverse function to reduction, is the conversion of a quantity that is expressed as a single unit of measure to a compound unit, such as expanding 24 oz to 1 lb 8 oz.
  • Normalization is the conversion of a set of compound units to a standard form—for example, rewriting "1 ft 13 in" as "2 ft 1 in".

Knowledge of the relationship between the various units of measure, their multiples and their submultiples forms an essential part of compound unit arithmetic.

Principles of compound unit arithmetic

There are two basic approaches to compound unit arithmetic:

  • Reduction–expansion method where all the compound unit variables are reduced to single unit variables, the calculation performed and the result expanded back to compound units. This approach is suited for automated calculations. A typical example is the handling of time by Microsoft Excel where all time intervals are processed internally as days and decimal fractions of a day.
  • On-going normalization method in which each unit is treated separately and the problem is continuously normalized as the solution develops. This approach, which is widely described in classical texts, is best suited for manual calculations. An example of the ongoing normalization method as applied to addition is shown below.

The addition operation is carried out from right to left; in this case, pence are processed first, then shillings followed by pounds. The numbers below the "answer line" are intermediate results.

The total in the pence column is 25. Since there are 12 pennies in a shilling, 25 is divided by 12 to give 2 with a remainder of 1. The value "1" is then written to the answer row and the value "2" carried forward to the shillings column. This operation is repeated using the values in the shillings column, with the additional step of adding the value that was carried forward from the pennies column. The intermediate total is divided by 20 as there are 20 shillings in a pound. The pound column is then processed, but as pounds are the largest unit that is being considered, no values are carried forward from the pounds column.

For the sake of simplicity, the example chosen did not have farthings.

Operations in practice

A scale calibrated in imperial units, with an associated cost display

During the 19th and 20th centuries various aids were developed to aid the manipulation of compound units, particularly in commercial applications. The most common aids were mechanical tills which were adapted in countries such as the United Kingdom to accommodate pounds, shillings, pence and farthings, and ready reckoners, which are books aimed at traders that catalogued the results of various routine calculations such as the percentages or multiples of various sums of money. One typical booklet[158] that ran to 150 pages tabulated multiples "from one to ten thousand at the various prices from one farthing to one pound".

The cumbersome nature of compound unit arithmetic has been recognized for many years—in 1586, the Flemish mathematician Simon Stevin published a small pamphlet called De Thiende ("the tenth")[159] in which he declared the universal introduction of decimal coinage, measures, and weights to be merely a question of time. In the modern era, many conversion programs, such as that included in the Microsoft Windows 7 operating system calculator, display compound units in a reduced decimal format rather than using an expanded format (e.g., "2.5 ft" is displayed rather than "2 ft 6 in").

Number theory

Number theory studies the structure and properties of integers as well as the relations and laws between them.[34][160][161] Some of the main branches of modern number theory include elementary number theory, analytic number theory, algebraic number theory, and geometric number theory.[162][163] Elementary number theory studies aspects of integers that can be investigated using elementary methods. In this regard, it excludes the use of methodes found in analysis and calculus. Its topics include divisibility, factorization, and primality.[164][165] Analytic number theory, by contrast, relies on techniques from analysis and calculus. It examines problems like how prime numbers are distributed and the claim that every even number is a sum of two prime numbers.[162][166] Algebraic number theory employs algebraic structures to analyze the properties of and relations between numbers. Examples are the use of fields and rings, as in algebraic number fields like the ring of integers. Geometric number theory uses concepts from geometry to study numbers. For instance, it investigates how lattice points with integer coordinates behave in a plane.[167][168] Further branches of number theory are probabilistic number theory, combinatorial number theory, computational number theory, and applied number theory.[163][169]

Influential theorems in number theory include the fundamental theorem of arithmetic, Euclid's theorem, and Fermat's last theorem.[34][170] According to the fundamental theorem of arithmetic, every integer greater than 1 is either a prime number or can be represented as a unique product of prime numbers. For example, the number 18 is not a prime number and can be represented as , all of which are prime numbers. The number 19, by contrast, is a prime number that has no other prime factorization.[171][172] Euclid's theorem states that there are infinitely many prime numbers.[34][173] Fermat's last theorem is the statement that no integer values can be found for , , and , to solve the equation if is greater than .[34][174]

Arithmetic in education

Primary education in mathematics often places a strong focus on algorithms for the arithmetic of natural numbers, integers, fractions, and decimals (using the decimal place-value system). This study is sometimes known as algorism.

The difficulty and unmotivated appearance of these algorithms has long led educators to question this curriculum, advocating the early teaching of more central and intuitive mathematical ideas. One notable movement in this direction was the New Math of the 1960s and 1970s, which attempted to teach arithmetic in the spirit of axiomatic development from set theory, an echo of the prevailing trend in higher mathematics.[175]

Also, arithmetic was used by Islamic Scholars in order to teach application of the rulings related to Zakat and Irth. This was done in a book entitled The Best of Arithmetic by Abd-al-Fattah-al-Dumyati.[176] The book begins with the foundations of mathematics and proceeds to its application in the later chapters.

History

Photo of the Ishango bone
Some historians interpret the Ishango bone as one of the earliest arithmetic artifacts.

The earliest forms of arithmetic are sometimes traced back to counting and tally marks used to keep track of quantities. Some historians suggest that the Lebombo bone (dated about 43,000 years ago) and the Ishango bone (dated about 22,000 to 30,000 years ago) are the oldest arithmetic artifacts but this interpretation is disputed.[177][178][179] However, a basic sense of numbers may predate these findings and might even have existed before the development of language.[180][181]

However, it was not until the emergence of ancient civilizations that a more complex and structured approach to arithmetic began to evolve, starting around 3000 BCE. This became necessary because of the increased need to keep track of stored items, manage land ownership, and arrange exchanges.[182][183] All the major ancient civilizations developed non-positional numeral systems to facilitate the representation of numbers. They also included symbols for operations like addition and subtraction and were aware of fractions. Examples are Egyptian hieroglyphics as well as the numeral systems used in Sumeria, China, and India.[184][185] The first positional numeral system was developed by the Babylonians starting around 1800 BCE. This was a significant improvement over earlier numeral systems since it made the representation of large numbers and calculations on them more efficient.[186][187] Abacuses were used as hand-operated calculating tools since ancient times as efficient means for performing complex calculations.[188][189]

Photo of a Chinese abacus
Abacuses were used as manual calculation tools in ancient civilizations, such as the Suanpan in China.

Early civilizations primarily used numbers for concrete practical purposes and lacked an abstract concept of number itself.[190][191] This changed with the ancient Greek mathematicians, who began to explore the abstract nature of numbers rather than studying how they are applied to specific problems.[192][191] Another novel feature was their use of proofs to establish mathematical truths and validate theories.[192][193] A further contribution was their distinction of various classes of numbers, such as even numbers, odd numbers, and prime numbers.[194][195] This included the discovery that numbers for certain geometrical lengths are irrational and therefore cannot be expressed as a fraction.[196][197] The works of Thales of Miletus and Pythagoras in the 7th and 6th centuries BCE are often regarded as the inception of Greek mathematics.[198][199] Diophantus was an influential figure in Greek arithmetic in the 3rd century BCE because of his numerous contributions to number theory and his exploration of the application of arithmetic operations to algebraic equations.[200][201]

The ancient Indians were the first to developed the concept of zero as a number to be used in calculations. The exact rules of its operation were written down by Brahmagupta in around 628 CE.[202][203][204] The concept of zero as a general term existed long before but it was understood as an empty placeholder rather than an object of arithmetic operations.[205][206] Brahmagupta further provided a detailed discussion of calculations with negative numbers and their application to problems like credit and debt.[207][203][204] The concept of negative numbers itself is significantly older and was first explored in Chinese mathematics in the first millennium BCE.[208][209]

Indian mathematicians developed the positional decimal numeral system common today. For example, a detailed treatment of its operations was provided by Aryabhata around the turn of the 6th century CE.[210][204] The Indian decimal system was further refined and expanded during the Islamic Golden Age by Arab mathematicians such as Al-Khwarizmi. His work was influential in introducing the decimal numeral system to the Western world, which had previously relied on the non-positional Roman numeral system.[211][204] There, it was popularized by mathematicians like Leonardo Fibonacci, who lived in the 12th and 13th centuries and also developed the Fibonacci sequence.[212][213] During the Middle Ages and Renaissance, many popular textbooks were published to cover the practical calculations for commerce. The use of abacuses also became widespread in this period.[214][215] In the 16th century, the mathematician Gerolamo Cardano conceived the concept of complex numbers as a way to solve cubic equations.[216][217]

Leibniz's stepped reckoner was the first calculator that could perform all four arithmetic operations.[218]

The first mechanical calculators were developed in the 17th century and greatly facilitated complex mathematical calculations, such as Blaise Pascal's calculator and Gottfried Wilhelm Leibniz's stepped reckoner.[219][220][221] The 17th century also saw the discovery of the logarithm by John Napier.[222][223]

In the 18th and 19th centuries, mathematicians such as Leonhard Euler and Carl Friedrich Gauss laid the foundations of modern number theory.[224][225][226] Another development in this period concerned work on the formalization and foundations of arithmetic, such as Georg Cantor's set theory and the Dedekind–Peano axioms used as an axiomatization of natural-number arithmetic.[227][228] Computers and electronic calculators were first developed in the 20th century. Their widespread use revolutionized both the accuracy and speed with which even complex arithmetic computations can be calculated.[229][230][231]

See also

Related topics

References

Citations

  1. ^ a b Romanowski 2008, pp. 302–303.
  2. ^ a b HS staff 2022.
  3. ^ a b MW staff 2023.
  4. ^ a b c d e f EoM staff 2020a.
  5. ^ a b Burgin 2022, pp. 57, 77.
  6. ^ a b MacDuffee, lead section.
  7. ^ a b Adamowicz 1994, p. 299, The Power of Exponentiation in Arithmetic.
  8. ^ Peirce 2015, p. 109.
  9. ^ Waite 2013, p. 42.
  10. ^ Smith 1958, p. 7.
  11. ^ Oliver 2005, p. 58.
  12. ^ Hofweber 2016, p. 153.
  13. ^ Sophian 2017, p. 84.
  14. ^ Stevenson & Waite 2011, p. 70.
  15. ^ a b Romanowski 2008, pp. 303–304.
  16. ^ Lozano-Robledo 2019, p. xiii.
  17. ^ Nagel & Newman 2008, p. 4.
  18. ^ Wilson 2020, pp. 1–2.
  19. ^ EoM staff 2020b.
  20. ^ Campbell 2012, p. 33.
  21. ^ a b Robbins 2006, p. 1.
  22. ^ Duverney 2010, p. v.
  23. ^ Musser, Peterson & Burger 2013, p. 17.
  24. ^ Kleiner 2012, p. 255.
  25. ^ Marcus & McEvoy 2016, p. 285.
  26. ^ Monahan 2012, 2. Basic Computational Algorithms.
  27. ^ Romanowski 2008, pp. 302–304.
  28. ^ a b Khattar 2010, pp. 1–2.
  29. ^ Nakov & Kolev 2013, pp. 270–271.
  30. ^ a b c d e Nagel 2002, pp. 180–181.
  31. ^ Luderer, Nollau & Vetters 2013, p. 9.
  32. ^ a b c d e f g h Romanowski 2008, p. 304.
  33. ^ a b c d e f g h Hindry 2011, p. x.
  34. ^ a b c d e EoM staff 2016.
  35. ^ Rajan 2022, p. 17.
  36. ^ Hafstrom 2013, p. 6.
  37. ^ a b Hafstrom 2013, p. 95.
  38. ^ a b Hafstrom 2013, p. 123.
  39. ^ Hosch 2023.
  40. ^ a b c Gellert et al. 2012, p. 33.
  41. ^ a b Musser, Peterson & Burger 2013, p. 358.
  42. ^ a b c Musser, Peterson & Burger 2013, pp. 358–359.
  43. ^ a b c Rooney 2021, p. 34.
  44. ^ Ward 2012, p. 55.
  45. ^ Orr 1995, p. 49.
  46. ^ Nelson 2019, p. xxxi.
  47. ^ Ore 1948, pp. 1–2.
  48. ^ HC staff 2022.
  49. ^ HC staff 2022a.
  50. ^ a b c Ore 1948, pp. 8–10.
  51. ^ Nakov & Kolev 2013, pp. 270–272.
  52. ^ Stakhov 2020, p. 73.
  53. ^ a b Nakov & Kolev 2013, pp. 271–272.
  54. ^ a b c Jena 2021, pp. 17–18.
  55. ^ a b Mazumder & Ebong 2023, pp. 18–19.
  56. ^ Moncayo 2018, p. 25.
  57. ^ Ore 1948, p. 8.
  58. ^ Mazumder & Ebong 2023, p. 18.
  59. ^ Stakhov 2020, pp. 77–78.
  60. ^ a b c d e f Romanowski 2008, p. 303.
  61. ^ Yan 2013, p. 261. sfn error: multiple targets (3×): CITEREFYan2013 (help)
  62. ^ ITL Education Solutions Limited 2011, p. 28.
  63. ^ Ore 1948, pp. 2–3.
  64. ^ Nagel 2002, p. 178.
  65. ^ Jena 2021, pp. 20–21.
  66. ^ Null & Lobur 2006, p. 40.
  67. ^ Stakhov 2020, p. 74.
  68. ^ Nagel 2002, p. 179.
  69. ^ Husserl & Willard 2012, pp. XLIV–XLV, Translator's Introduction.
  70. ^ O'Leary 2015, p. 190.
  71. ^ Rising et al. 2021, p. 110.
  72. ^ a b Nagel 2002, pp. 177, 179–180.
  73. ^ Khan & Graham 2018, pp. 9–10.
  74. ^ Smyth 1864, p. 55.
  75. ^ Tarasov 2008, pp. 57–58.
  76. ^ a b c d e Mazzola, Milmeister & Weissmann 2004, p. 66.
  77. ^ a b Krenn & Lorünser 2023, p. 8.
  78. ^ a b Kay 2021, pp. 44–45.
  79. ^ a b c d Wright, Ellemor-Collins & Tabor 2011, p. 136.
  80. ^ Musser, Peterson & Burger 2013, p. 87.
  81. ^ Burgin 2022, p. 25.
  82. ^ Musser, Peterson & Burger 2013, pp. 93–94.
  83. ^ a b c Wheater 2015, p. 19.
  84. ^ a b Wright, Ellemor-Collins & Tabor 2011, p. 136–137.
  85. ^ Achatz & Anderson 2005, p. 18.
  86. ^ a b Nagel 2002, pp. 179–180.
  87. ^ a b Musser, Peterson & Burger 2013, pp. 101–102.
  88. ^ a b Kay 2021, p. 117.
  89. ^ Musser, Peterson & Burger 2013, pp. 117–118.
  90. ^ Kay 2021, pp. 27–28.
  91. ^ Kay 2021, p. 118.
  92. ^ Klose 2014, p. 105.
  93. ^ Kay 2021, pp. 121–122.
  94. ^ Rodda & Little 2015, p. 7.
  95. ^ Sally & Sally (Jr.) 2012, p. 3.
  96. ^ Klose 2014, pp. 107–108.
  97. ^ Kupferman 2015, pp. 45, 92.
  98. ^ Uspenskii & Semenov 2001, p. 113.
  99. ^ Geary 2006, p. 796.
  100. ^ Resnick & Ford 2012, p. 110.
  101. ^ Klein et al. 2010, pp. 67–68.
  102. ^ Quintero & Rosario 2016, p. 74.
  103. ^ Ebby, Hulbert & Broadhead 2020, pp. 24–26.
  104. ^ Sperling & Stuart 1981, p. 7.
  105. ^ Sperling & Stuart 1981, p. 8.
  106. ^ Ma 2020, pp. 35–36.
  107. ^ Sperling & Stuart 1981, p. 9.
  108. ^ Mooney et al. 2014, p. 148.
  109. ^ Klein 2013, p. 249.
  110. ^ Muller et al. 2018, p. 539.
  111. ^ Davis, Goulding & Suggate 2017, pp. 11–12.
  112. ^ Haylock & Cockburn 2008, p. 49.
  113. ^ Prata 2002, p. 138.
  114. ^ Koepf 2021, p. 49.
  115. ^ Goodstein 2014, p. 33.
  116. ^ Cafaro, Epicoco & Pulimeno 2018, p. 7, Techniques for Designing Bioinformatics Algorithms.
  117. ^ Reilly 2009, p. 75.
  118. ^ a b c Cuyt et al. 2008, p. 182.
  119. ^ a b Mahajan 2010, pp. 66–69.
  120. ^ Kay 2021, pp. 57.
  121. ^ Gellert et al. 2012, p. 30.
  122. ^ Gellert et al. 2012, pp. 31–32.
  123. ^ Musser, Peterson & Burger 2013, p. 347.
  124. ^ Gellert et al. 2012, pp. 32–33.
  125. ^ Klose 2014, p. 107.
  126. ^ Hoffman & Frankel 2018, pp. 161–162.
  127. ^ Lange 2010, pp. 248–249.
  128. ^ Klose 2014, pp. 105–107.
  129. ^ a b Igarashi et al. 2014, p. 18.
  130. ^ Gellert et al. 2012, p. 35.
  131. ^ Booker et al. 2015, pp. 308–309.
  132. ^ Gellert et al. 2012, p. 34.
  133. ^ a b EoM staff 2020.
  134. ^ a b Young 2010, pp. 994–996.
  135. ^ Rossi 2011, p. 101.
  136. ^ Reitano 2010, p. 42.
  137. ^ Bronshtein et al. 2015, p. 2.
  138. ^ Wallis 2013, pp. 20–21.
  139. ^ Young 2010, pp. 996–997.
  140. ^ Young 2021, pp. 4–5.
  141. ^ a b Koren 2018, p. 71.
  142. ^ Wallis 2013, p. 20.
  143. ^ Roe, deForest & Jamshidi 2018, p. 24.
  144. ^ a b Muller et al. 2009, pp. 13–16.
  145. ^ Swartzlander 2017, p. 11.19, High-Speed Computer Arithmetic.
  146. ^ Stewart 2022, p. 26.
  147. ^ Meyer 2023, p. 234.
  148. ^ Muller et al. 2009, pp. 54.
  149. ^ Brent & Zimmermann 2010, p. 79.
  150. ^ Cryer 2014, p. 450.
  151. ^ Leonardo Pisano – p. 3: "Contributions to number theory" Archived 2008-06-17 at the Wayback Machine. Encyclopædia Britannica Online, 2006. Retrieved 18 September 2006.
  152. ^ Walkingame, Francis (1860). The Tutor's Companion; or, Complete Practical Arithmetic (PDF). Webb, Millington & Co. pp. 24–39. Archived from the original (PDF) on 2015-05-04.
  153. ^ Palaiseau, JFG (October 1816). Métrologie universelle, ancienne et moderne: ou rapport des poids et mesures des empires, royaumes, duchés et principautés des quatre parties du monde [Universal, ancient and modern metrology: or report of weights and measurements of empires, kingdoms, duchies and principalities of all parts of the world] (in French). Bordeaux. Archived from the original on September 26, 2014. Retrieved October 30, 2011.
  154. ^ Jacob de Gelder (1824). Allereerste Gronden der Cijferkunst [Introduction to Numeracy] (in Dutch). 's-Gravenhage and Amsterdam: de Gebroeders van Cleef. pp. 163–176. Retrieved March 2, 2011.
  155. ^ Malaisé, Ferdinand (1842). Theoretisch-Praktischer Unterricht im Rechnen für die niederen Classen der Regimentsschulen der Königl. Bayer. Infantrie und Cavalerie [Theoretical and practical instruction in arithmetic for the lower classes of the Royal Bavarian Infantry and Cavalry School] (in German). Munich. Archived from the original on 25 September 2012. Retrieved 20 March 2012.
  156. ^ "Arithmetick". Encyclopædia Britannica. Vol. 1 (1st ed.). Edinburgh: A. Bell and C. Macfarquhar. 1771. pp. 365–423.
  157. ^ Walkingame, Francis (1860). "The Tutor's Companion; or, Complete Practical Arithmetic" (PDF). Webb, Millington & Co. pp. 43–50. Archived from the original (PDF) on 2015-05-04.
  158. ^ Thomson, J (1824). The Ready Reckoner in miniature containing accurate table from one to the thousand at the various prices from one farthing to one pound. Montreal. ISBN 978-0665947063. Archived from the original on 28 July 2013. Retrieved 25 March 2012.
  159. ^ O'Connor, John J.; Robertson, Edmund F. (January 2004), "Arithmetic", MacTutor History of Mathematics Archive, University of St Andrews
  160. ^ Grigorieva 2018, pp. viii–ix.
  161. ^ Page 2003, p. 15.
  162. ^ a b Page 2003, p. 34.
  163. ^ a b Yan 2013, p. 12. sfn error: multiple targets (3×): CITEREFYan2013 (help)
  164. ^ Page 2003, pp. 18–19, 34.
  165. ^ EoM staff 2014a.
  166. ^ EoM staff 2014.
  167. ^ Page 2003, pp. 34–35.
  168. ^ EoM staff 2019.
  169. ^ Yan 2013, p. 15. sfn error: multiple targets (3×): CITEREFYan2013 (help)
  170. ^ Křížek, Somer & Šolcová 2021, pp. 23, 25, 37.
  171. ^ Křížek, Somer & Šolcová 2021, p. 23.
  172. ^ Riesel 2012, p. 2.
  173. ^ Křížek, Somer & Šolcová 2021, p. 25.
  174. ^ Křížek, Somer & Šolcová 2021, p. 37.
  175. ^ Mathematically Correct: Glossary of Terms
  176. ^ al-Dumyati, Abd-al-Fattah Bin Abd-al-Rahman al-Banna (1887). "The Best of Arithmetic". World Digital Library (in Arabic). Retrieved 30 June 2013.
  177. ^ Burgin 2022, pp. 2–3.
  178. ^ Ore 1948, pp. 1, 6, 8, 10.
  179. ^ Thiam & Rochon 2019, p. 164.
  180. ^ Burgin 2022, p. 3.
  181. ^ Ponticorvo, Schmbri & Miglino 2019, p. 33.
  182. ^ Burgin 2022, pp. 4–6.
  183. ^ Ang & Lam 2004, p. 170.
  184. ^ Burgin 2022, pp. 5–7, 9–11.
  185. ^ Ore 1948, pp. 10–15.
  186. ^ Burgin 2022, pp. 6–7, 9.
  187. ^ Ore 1948, pp. 16–18.
  188. ^ Ore 1948, p. 15.
  189. ^ Yadin 2016, p. 24.
  190. ^ Burgin 2022, pp. 4–5.
  191. ^ a b Brown 2010, p. 184.
  192. ^ a b Burgin 2022, p. 15.
  193. ^ Madden & Aubrey 2017, p. xvii.
  194. ^ Burgin 2022, p. 31.
  195. ^ Payne 2017, p. 202.
  196. ^ Burgin 2022, pp. 20–21, 34.
  197. ^ Bloch 2011, p. 52.
  198. ^ Burgin 2022, p. 16.
  199. ^ Lützen 2023, p. 19.
  200. ^ Burgin 2022, pp. 29–31.
  201. ^ Klein 2013a, p. 12.
  202. ^ Burgin 2022, pp. 36–37.
  203. ^ a b Bradley 2006, pp. 82–83.
  204. ^ a b c d Conradie & Goranko 2015, p. 268.
  205. ^ Burgin 2022, pp. 35–36.
  206. ^ Cai 2023, p. 110.
  207. ^ Burgin 2022, p. 37, 40.
  208. ^ Hua & Feng 2020, pp. 119–120.
  209. ^ Chemla, Keller & Proust 2023, p. 47.
  210. ^ Burgin 2022, pp. 13, 34.
  211. ^ Burgin 2022, pp. 38, 43–46.
  212. ^ Burgin 2022, p. 56.
  213. ^ Oakes 2020, p. 330.
  214. ^ Burgin 2022, p. 55.
  215. ^ Wedell 2015, pp. 1235–1236, Numbers.
  216. ^ Burgin 2022, p. 62.
  217. ^ Lützen 2023, p. 124.
  218. ^ Vullo 2020, p. 140.
  219. ^ Cignoni & Cossu 2016, p. 103.
  220. ^ Koetsier 2018, p. 255.
  221. ^ Igarashi et al. 2014, pp. 87–89.
  222. ^ Burgin 2022, p. 77.
  223. ^ Eriksson, Estep & Johnson 2013, p. 474.
  224. ^ Burgin 2022, p. 68–72.
  225. ^ Weil 2009, p. ix.
  226. ^ Karlsson 2011, p. 309.
  227. ^ Burgin 2022, pp. 2, 88, 95–97.
  228. ^ Wang 1997, p. 334.
  229. ^ Burgin 2022, pp. 119, 124.
  230. ^ Curley 2011, pp. 5, 19.
  231. ^ Igarashi et al. 2014, p. 149.

Sources

Further reading

External links