This site is supported by donations to The OEIS Foundation.

Fractions

From OeisWiki
Jump to navigationJump to search


This article needs more work.

Please help by expanding it!


Fractions are rational numbers, that is the ratio (or division) of an integer (the numerator) by a positive integer (the denominator), generally represented vertically as

nd,n,d+

or horizontally as n/d,n,d+. (n1 is the [trivial] fraction corresponding to the integer n,n.)

If the numerator and the denominator are coprime, then the fraction is said to be in reduced form, i.e. written in lowest terms. For example, 1216=34.

If |n|>d>0, the fraction is sometimes referred to as an improper fraction, in which case it might be rewritten as (sometimes referred to as a mixed fraction)

sgn(n)(|n|d+(|n|d|n|d)dd),n,d+,

where sgn(n) is the sign function and |n| is the absolute value.

For example, 43=1+13, though generally the addition sign becomes a tacit operator, e.g. 113.

One important sequence of fractions is the sequence of even-index Bernoulli numbers

{1,16,130,142,130,566,6912730,76,}

In the OEIS, sequences of fractions[1] are generally rendered as two sequences of integers, one for the numerator, the other for the denominator. Both sequences then have Keyword frac and cross-references to each other. In the Bernoulli example, A000367 gives the numerators and A002445 gives the denominators.

However, for sequences of unit fractions, we could say that such and such sequence has the denominators and A000012 has the numerators for all of them.

Reduced form

[edit]

Given a fraction ND, one obtains the reduced form (fraction in lowest terms) nd=ND by respectively dividing the numerator N and the denominator D by the gcd of N and D

n=Ngcd(N,D),d=Dgcd(N,D).

Proper, improper and mixed fractions

[edit]

Fractions are sometimes referred to as either

  • Proper fractions: fractions nd s.t. |n|<d,n,d+;
  • Improper fractions: fractions nd s.t. |n|d,n,d+;
  • Mixed fractions: fractions i+nd s.t. i and |n|<d,n,d+.

Denumerability of fractions

[edit]

The fractions nd,n,d+, are denumerable (i.e. the set of fractions have the cardinality of the integers), since you may well-order them (in lexicographic order), first by the sum |n|+d of absolute value of numerator and denominator, then by numerator n,(|n|+d)<n<|n|+d, discarding fractions which are not in reduced form along the way, giving

{01,11,11,21,12,12,21,31,13,13,31,41,32,23,14,14,23,32,41,51,15,15,51,61,52,43,34,25,16,16,25,34,43,52,61,}

A037161 Well-order the rational numbers; take numerators. (Interesting graph!)

{0, -1, 1, -2, -1, 1, 2, -3, -1, 1, 3, -4, -3, -2, -1, 1, 2, 3, 4, -5, -1, 1, 5, -6, -5, -4, -3, -2, -1, 1, 2, 3, 4, 5, 6, -7, -5, -3, -1, 1, 3, 5, 7, -8, -7, -5, -4, -2, -1, 1, 2, 4, 5, 7, 8, ...}

A037162 Well-order the rational numbers; take denominators.

{1, 1, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 3, 4, 4, 3, 2, 1, 1, 5, 5, 1, 1, 2, 3, 4, 5, 6, 6, 5, 4, 3, 2, 1, 1, 3, 5, 7, 7, 5, 3, 1, 1, 2, 4, 5, 7, 8, 8, 7, 5, 4, 2, 1, ...}

The number of fractions nd,n,d+, with |n|+d=k,k1 is given by the following sequence.

A140434 Number of new visible points created at each step in an n X n grid.

{1, 2, 4, 4, 8, 4, 12, 8, 12, 8, 20, 8, 24, 12, 16, 16, 32, 12, 36, 16, 24, 20, 44, 16, 40, 24, 36, 24, 56, 16, 60, 32, 40, 32, 48, 24, 72, 36, 48, 32, 80, 24, 84, 40, 48, 44, ...}

See also

[edit]

Notes

[edit]