The official Python documentation for the fractions module is here.

Writing numbers that aren't integers as fractions dates back to the Egyptians and the Babylonians, before the use of decimals. Whenever the denominator is not a power of 10, we still often use fractions, although they may be somewhat hidden:

- If we say a man is 5 foot 7 inches, his height in feet is (there are twelve inches to the foot);
- When we say it's 8:13 am, we mean that exactly hours (493 minutes) have passed since midnight.
- When Romeo complains that he has waited more than three quarters of an hour for Juliet, he is expressing the duration of his anticipation as a fraction...
- Probabilities are often given as fractions (usually Egyptian fractions), as in "I have a one in ten million chance of winning the lottery", or "the odds are 5 to 1".
- Statistics may also be quoted as fractions: "5 out of every 6 people wear jumpers".

The equation 0.2+0.5=0.7 can be written , but the equation can't be written exactly using decimal numbers. *Python* gives the result of 1/2+1/3 as 0.8333333333333333; despite all the digits, this is not the exact answer.

For exact calculations with fractions, Python has a `fractions`

module. To use the scripts in this chapter, start with the line:

from fractions import *

This will import everything from the fractions module.

# Obtaining a fractionEdit

To enter the fraction in *Python*, use `Fraction(n,d)`

, remembering to import it from the *fractions* module:

from fractions import * a = Fraction(24,10) print(a) # 12/5

We find that Python automatically simplified the fraction when it was instantiated.

If you enter 0 as the denominator, the fraction won't be created, and an error message will occur. We can't divide a number by 0.

Once we have calculated a fraction, we can get its numerator and denominator:

from fractions import * a = Fraction(24,10) print(a.numerator) print(a.denominator)

Of course, the numerator of is not 24, once it has been simplified.

To get the value of the fraction (its numerator divided by its denominator), we can convert it to a 'float' - this refers to how computers typically store numbers other than integers (as 'floating point' numbers):

from fractions import * a = Fraction(24,10) print(float(a))

We can also convert a real number to a fraction, but the result may be surprising, if the number is one that can't be represented exactly in binary:

from fractions import * a = Fraction.from_float(1.2) print(a)

Instead of , we get the fraction . This is because can't be stored precisely in binary, just as can't be written exactly as a decimal. In this case, we can get a better result by going straight from the decimal to the fraction, without the computer converting it to binary:

from fractions import * a = Fraction('1.2') print(a)

# OperationsEdit

Operations on fractions are written as for other numbers, but the result is generally a fraction.

## Unary OperationsEdit

### NegationEdit

To negate a fraction, precede it with the `-`

sign. For example:

from fractions import * a = Fraction(2,-3) print(-a)

### InversionEdit

To find the inverse of a fraction, divide 1 by it:

from fractions import * a = Fraction(5,4) print(1/a)

## AdditionEdit

The sum of two fractions is a fraction:

from fractions import * a = Fraction(34,21) b = Fraction(21,13) print(a+b)

## SubtractionEdit

The difference of two fractions is a fraction:

from fractions import * a = Fraction(1/3) b = Fraction(1/4) print(a-b)

## MultiplicationEdit

The product of two fractions is a fraction:

from fractions import * a = Fraction(34,21) b = Fraction(21,13) print(a*b)

## DivisionEdit

The quotient of two fractions is a fraction (so long as the second is not zero):

from fractions import * a = Fraction(34,21) b = Fraction(21,13) print(a/b)

The remainder (or modulo) can also be found for fractions. The result is a fraction:

from fractions import * a = Fraction(32,7) b = Fraction(7,2) print(a%b)

## PowerEdit

If the exponent is an integer, the power of a fraction is a fraction:

from fractions import * a = Fraction(3,2) print(a**12) print(a**(-1))

But if the exponent is a real number, the power of a fraction is a real number:

from fractions import * a = Fraction(9,4) print(a**0.5)

# AlgorithmsEdit

## Farey reductionEdit

Creating a Farey reduction is easy with Python's `fractions`

module:

from fractions import * def Farey(a,b): n = a.numerator+b.numerator d = a.denominator+b.denominator return Fraction(n,d) a = Fraction(3,4) b = Fraction(1,13) print(Farey(a,b))

This can be used make a Stern-Brocot tree; that may not clarify much, but it has mathematical uses.

## Egyptian fractionsEdit

An Egyptian fraction is made of a series of inverse integers; the Egyptians had a reputation for not using numerators. Any fraction can be written as a sum of Egyptian fractions, and we can use Fibonacci's algorithm to find such a sum for any fraction. In the *Python* example below, the algorithm produces a list of fractions, all with numerator 1, which add up to the given fraction **f**. Since **f** may be greater than 1, we start the list with an integer:

from fractions import * from math import ceil def egypt(f): e = int(f) f -= e parts = [e] while(f.numerator>1): e = Fraction(1, int(ceil(1/f))) parts.append(e) f -= e parts.append(f) return parts a = Fraction(21,13) print(egypt(a)) # [1, Fraction(1, 2), Fraction(1, 9), Fraction(1, 234)] print(sum(egypt(a)) # 21/13 (confirming that these fractions add up to the original value)

Some explanation of the code above: the denominator of each Egyptian fraction should be an integer, and greater than the inverse of the fraction **f**, so that the algorithm converges. One solution would be to round the inverse down to an integer (with `int`

) and add 1. But if the inverse of **f** is an integer, adding 1 would lead to an infinite series. So we use the `ceil`

function, to round up to an integer. Therefore:

- We had to import this function from the
`math`

module. - The result of
`ceil(1/f)`

is a real number, not an integer, so we can't use it directly in a fraction (Python gives an error). We convert it into an integer using`int`

.

Finally, we have to add the last Egyptian fraction to the list, to complete the series.

Running the script above, we find that .