Fraction (mathematics): Difference between revisions
imported>Olier Raby (→Subtraction: Shorter.) |
imported>Olier Raby (→Addition: Shorter.) |
||
Line 95: | Line 95: | ||
=== Addition === | === Addition === | ||
Formally, apply this algorithm to add | Formally, apply this algorithm to add the fractions <math> \frac{a}{b} </math> and <math> \frac{c}{d} </math> : | ||
# <math> e = gcd(ad+bc, bd) \,</math> | # <math> e = gcd(ad+bc, bd) \,</math> | ||
# <math> \frac{a}{b} + \frac{c}{d} = \frac{(ad+bc) \div e }{ bd \div e}</math> | # <math> \frac{a}{b} + \frac{c}{d} = \frac{(ad+bc) \div e }{ bd \div e}</math> |
Revision as of 06:06, 9 March 2008
In mathematics, a fraction (from the Latin fractus, meaning broken) is a concept used to convey a proportional relation between a part and the whole. It consists of a numerator (an integer - the part) and a denominator (a natural number - the whole). For instance, the fraction can represent three equal parts of a whole object, if the object is divided into five equal parts. We can represent all rational numbers with fractions.
Fractions are a special case of ratios. For instance, is a valid ratio, but it is not a fraction since we cannot compute an equivalent fraction with an integer numerator and a natural number denominator. A fraction with equal numerator and denominator is equal to one (e.g., ). Because the division by zero is undefined, zero should never be the denominator of a fraction.
Due to tradition and conventions, there are at least two ways to write a fraction. The numerator and the denominator may be separated by a slash (a slanted line : 3/4), or by a vinculum (an horizontal line : ). Since we can compute the quotient from a fraction, we can represent any fraction with a decimal numeral (e.g., ). Template:TOC-right
Forms
A vulgar fraction (or common fraction) simply refers to a numerator divided by a denominator (e.g., and ). It is said to be a proper fraction if the absolute value of the numerator is less than the absolute value of the denominator (e.g. ). An improper fraction (in Great Britain, top-heavy fraction) is said if the absolute value of the numerator is greater than or equal to the absolute value of the denominator (e.g. ). All non-zero integers can be represented by an improper fraction, since for example . The 1 at the denominator is sometimes called an "invisible denominator".
A mixed number is the sum of an integer and a proper fraction (e.g., ). An improper fraction can be transformed into a mixed number and vice-versa.
Special cases
- A vulgar fraction with a numerator of 1, e.g. , is a unit fraction.
- An Egyptian fraction is the sum of distinct unit fractions, e.g. .
- A decimal fraction is a vulgar fraction in which the denominator is a power of ten, e.g. .
- A dyadic fraction is a vulgar fraction in which the denominator is a power of two, e.g. .
- An expression that has the form of a fraction but actually represents division by or into an irrational number is sometimes called an "irrational fraction". A common example found in trigonometry is , the measure of a right angle in radians.
- A continued fraction is an expression such as , where the are integers.
- Rational functions are represented in the form of a fraction, where the numerator and denominator are polynomials. They are the quotient field of the polynomials.
- In algebra, some rational expressions (a fraction with an algebraic expression in the denominator) are written as the sum of other rational expressions with denominators of lesser degree. For instance, the rational expression can be rewritten as the sum of two fractions : and . The decomposition is made of partial fractions.
Arithmetic operations
The most common arithmetic operations on fractions are addition, subtraction, multiplication, and division. When adding and subtracting, we must often compute the equivalent fractions. When dividing, we usually compute the multiplicative inverse.
After any computation, the end result should be an irreducible fraction.
In this section, it is understood that and .
Equivalent fractions
Multiplying (or integer dividing) the numerator and the denominator of a fraction by the same non-zero integer results in a new fraction that is said to be equivalent to the original fraction. For instance, and are equivalent, since the quotient of both fractions is 0.2.
A fraction where the numerator and the denominator do not have any common factor, 1 excepted, is said irreducible (or in its lowest terms). If it is not the case, then we divide its numerator and its denominator by their gcd. For instance, is not in lowest terms because both 4 and 20 can be exactly divided by 4, giving . In contrast, is in lowest terms.
Multiplication
Formally, apply this algorithm to multiply the two fractions , :
By hands, the multiplication is done like this.
- For the resulting fraction,
- Set its numerator to the product of both numerators.
- Set its numerator to the product of both denominators.
- Reduce the resulting fraction if you need to.
For instance, what is the result of ?
Since the result is not an irreducible fraction, we must reduce it. We divide the numerator and the denominator by 3 :
- .
Multiplicative inverse
The multiplicative inverse of a fraction is :
- .
Division
Dividing by a fraction is the same as multiplying by its inverse.
Formally, apply this algorithm to divide the two fractions , :
By hands, the division is done like this.
- Exchange the numerator and the denominator in the second fraction (equivalent to computing the multiplicative inverse).
- For the resulting fraction,
- Set its numerator to the product of both numerators.
- Set its numerator to the product of both denominators.
- Reduce the resulting fraction if you need to.
For instance, what is the result of ?
The result is an irreducible fraction.
Additive inverse
The additive inverse of a fraction is :
Addition
Formally, apply this algorithm to add the fractions and :
By hands, the addition is done like this.
- Compute an equivalent fraction of and , making sure both have the same denominator.
- For the resulting fraction,
- Set its numerator to the addition of the numerators.
- Set its denominator to the computed denominator (the three fractions have the same denominator).
- Reduce the resulting fraction if you need to.
For instance, what is the result of ?
Let's find a number that both denominators will divide : It is 12. We are ready to compute the equivalent fractions :
This is the final answer since it is an irreducible fraction.
Subtraction
Formally, apply this algorithm to subtract the fractions and :
By hands, the subtraction is done like this.
- Compute an equivalent fraction of and , making sure both have the same denominator.
- For the resulting fraction,
- Set its numerator to the subtraction of the numerators.
- Set its denominator to the computed denominator (the three fractions have the same denominator).
- Reduce the resulting fraction if you need to.
Since this algorithm is very similar to the addition algorithm, we do not give any example.
Improper fraction to mixed number
An improper fraction can be converted to a mixed number with this algorithm :
- Integer divide the numerator by the denominator.
- The quotient becomes the whole part and the remainder becomes the numerator of the fractional part.
- The fraction has the same denominator.
For instance, transform to a mixed number.
Mixed number to improper fraction
A mixed number can be converted to an improper fraction with this algorithm :
- Insert a plus symbol between the integer and the fraction.
- Replace the integer with its equivalent fraction on 1.
- Add both fractions.
For instance, transform to an improper fraction.
Mixed numbers arithmetic
Just like any fraction, we can add, subtract, multiply, and divide mixed numbers. However, before applying the operation, convert the mixed numbers to improper fraction, or you may get wrong results.
For instance, what is the sum of and ? The minus sign applies to the fraction : . The answer is or .
Decimal numerals to fractions
In many cases, it is easier to work with decimal numerals, but they lack precision compared to fractions. Sometimes an infinite number of decimals is required to convey the same kind of precision. Thus, it is often useful to convert decimal numerals into fractions.
Before going any further in this section, we need to observe a property of the decimal numerals. For instance, The infinite expansion is composed of 3s. For square root of 2, we have . The infinite expansion is composed of different digits without any repeated pattern. For 4.35, we have The infinite expansion is composed of zeroes, but they are not written down by convention. Thus, all numbers written in decimal notation have an infinite decimal expansion.
Because of this observation, we only need to use two algorithms to convert decimal numerals to fractions. In the decimal expansion,
- there is a repeating pattern.
- there is no repeating pattern.
Repeating pattern algorithm
- Excluding any repeated pattern, count the number of digits after the decimal separator (p) in the decimal numeral n.
- Compute
- Including the first repeated pattern, count the number of digits after the decimal separator (q) in the decimal numeral n.
- Compute
- Write the equation , where a is unknown.
- Isolate a, the fraction to find.
For instance, convert 7.85891891891... to a fraction.
- m is equal to 2
- 102 = 100
- 7.85891891891... × 100 = 785.891891891...
- n is equal to 5
- 105 = 100000
- 7.85891891891... × 100000 = 785891.891891...
- 100000 × a - 100 × a = 785891.891891... - 785.891891891...
- 99900 × a = 785106
- ...
For instance, convert 4.37 to a fraction.
- m is equal to 2.
- 102 = 100
- 4.37000... × 100 = 437.000...
- n is equal to 3.
- 103 = 1000
- 4.37000... × 1000 = 4370.00...
- 1000 × a - 100 × a = 4370.00... - 437.000...
- 900 × a = 3933
- ...
Non-repeating pattern algorithm
The conversion is done using observation and needs.
If the decimal numeral n is a multiple of (a truncated value of ), then solve , where k is the multiple to find. If the constant is unknown, then truncate the decimal expansion to needed precision. Convert the new numeral using repeating pattern algorithm.