|
|
|
|
partial fractions
|
(Definition)
|
|
|
Every fractional number, i. e. such rational number
that the integer is not divisible by the integer , can be decomposed to a sum of partial fractions as follows:
Here, the 's are distinct positive prime numbers, the 's positive integers and the 's some integers. Cf. the partial fractions of expressions.
Examples:
How to get the numerators for decomposing a fractional number
to partial fractions? First one can take the highest power of a prime which divides the denominator . Then
, where
. Euclid's algorithm gives some integers and such that
Dividing this equation by gives the decomposition
If has more than one distinct prime factors, a similar procedure can be made for the fraction
, and so on.
Note. The numerators , , ..., in the decomposition are not unique. E. g., we have also
Cf. the programme “Murto”(in Finnish) or “Murd” (in Estonian) or “Fraction”(in French) or “Bruch” (in German) or “Bråk” (in Swedish) at http://www.wakkanet.fi/(tilde)pahio/ohjelmi.html.
|
"partial fractions" is owned by pahio.
|
|
(view preamble)
| Other names: |
partial fractions of fractional numbers |
| Also defines: |
fractional number |
This object's parent.
|
|
Cross-references: decomposition, fraction, similar, prime factors, equation, Euclid's algorithm, denominator, divides, numerators, prime numbers, positive, sum, divisible, integer, rational number
There are 14 references to this entry.
This is version 27 of partial fractions, born on 2004-04-14, modified 2006-09-29.
Object id is 5761, canonical name is PartialFractions.
Accessed 9118 times total.
Classification:
| AMS MSC: | 11A41 (Number theory :: Elementary number theory :: Primes) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|