SUPPORT THE WORK

# GetWiki

### rational number

ARTICLE SUBJECTS
news  →
unix  →
wiki  →
ARTICLE TYPES
feed  →
help  →
wiki  →
ARTICLE ORIGINS
rational number
[ temporary import ]
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{redirect|Rationals||Rational (disambiguation)}}{{Refimprove|date=September 2013}}File:Number-systems.svg|thumb|The rational numbers (â„š) are included in the real numbers (â„). On the other hand, they include the integers (â„¤), which in turn include the natural numbersnatural numbersIn mathematics, a rational number is any number that can be expressed as the quotient or fraction {{math|p/q}} of two integers, a numerator {{math|p}} and a non-zero denominator {{math|q}}.BOOK, Rosen, Kenneth, 2007, Discrete Mathematics and its Applications, 6th, McGraw-Hill, New York, NY, 978-0-07-288008-3, 105, 158â€“160, Since {{math|q}} may be equal to 1, every integer is a rational number. The set of all rational numbers, often referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by a boldface {{math|Q}} (or blackboard bold mathbb{Q}, Unicode ℚ);WEB, Rouse, Margaret, Mathematical Symbols,weblink 1 April 2015, it was thus denoted in 1895 by Giuseppe Peano after (wikt:quoziente|quoziente), Italian for "quotient".The decimal expansion of a rational number always either terminates after a finite number of digits or begins to repeat the same finite sequence of digits over and over. Moreover, any repeating or terminating decimal represents a rational number. These statements hold true not just for base 10, but also for any other integer base (e.g. binary, hexadecimal).A real number that is not rational is called irrational. Irrational numbers include {{math|{{sqrt|2}}}}, {{pi}}, {{math|e}}, and {{math|Ï†}}. The decimal expansion of an irrational number continues without repeating. Since the set of rational numbers is countable, and the set of real numbers is uncountable, almost all real numbers are irrational.Rational numbers can be formally defined as equivalence classes of pairs of integers {{math|(p, q)}} such that {{math|q â‰  0}}, for the equivalence relation defined by {{math|(p1, q1) ~ (p2, q2)}} if, and only if {{math|p1q2 {{=}} p2q1}}. With this formal definition, the fraction {{math|p/q}} becomes the standard notation for the equivalence class of {{math|(p2, q2)}}.Rational numbers together with addition and multiplication form a field which contains the integers and is contained in any field containing the integers. In other words, the field of rational numbers is a prime field, and a field has characteristic zero if and only if it contains the rational numbers as a subfield. Finite extensions of {{math|Q}} are called algebraic number fields, and the algebraic closure of {{math|Q}} is the field of algebraic numbers.BOOK, Gilbert, Jimmie, Linda, Gilbert, 2005, Elements of Modern Algebra, 6th, Thomson Brooks/Cole, Belmont, CA, 0-534-40264-X, 243â€“244, In mathematical analysis, the rational numbers form a dense subset of the real numbers. The real numbers can be constructed from the rational numbers by completion, using Cauchy sequences, Dedekind cuts, or infinite decimals.

## Terminology

The term rational in reference to the set Q refers to the fact that a rational number represents a ratio of two integers. In mathematics, "rational" is often used as a noun abbreviating "rational number". The adjective rational sometimes means that the coefficients are rational numbers. For example, a rational point is a point with rational coordinates (that is a point whose coordinates are rational numbers; a rational matrix is a matrix of rational numbers; a rational polynomial may be a polynomial with rational coefficients, although the term "polynomial over the rationals" is generally preferred, for avoiding confusion with "rational expression" and "rational function" (a polynomial is a rational expression and defines a rational function, even if its coefficients are not rational numbers). However, a rational curve is not a curve defined over the rationals, but a curve which can be parameterized by rational functions.

## Arithmetic

### Irreducible fraction

Every rational number may be expressed in a unique way as an irreducible fraction {{math|a/b}}, where {{mvar|a}} and {{mvar|b}} are coprime integers, and {{math|b > 0}}. This is often called the canonical form.Starting from a rational number {{math|a/b}}, its canonical form may be obtained by dividing {{mvar|a}} and {{mvar|b}} by their greatest common divisor, and, if {{math|b < 0}}, changing the sign of the resulting numerator and denominator.

### Embedding of integers

Any integer {{math|n}} can be expressed as the rational number {{math|n/1}}, which is its canonical form as a rational number.

### Equality

frac{a}{b} = frac{c}{d} if and only if ad = bc.
If both fractions are in canonical form then
frac{a}{b} = frac{c}{d} if and only if a = c and b = d

### Ordering

If both denominators are positive, and, in particular, if both fractions are in canonical form,
frac{a}{b} < frac{c}{d} if and only if ad < bc.
If either denominator is negative, each fraction with a negative denominator must first be converted into an equivalent form with a positive denominator by changing the signs of both its numerator and denominator.

Two fractions are added as follows:
If both fractions are in canonical form, the result is in canonical form if and only if {{mvar|b}} and {{mvar|d}} are coprime integers.

### Subtraction

If both fractions are in canonical form, the result is in canonical form if and only if {{mvar|b}} and {{mvar|d}} are coprime integers.

### Multiplication

The rule for multiplication is:
frac{a}{b} cdotfrac{c}{d} = frac{ac}{bd}.
Even if both fractions are in canonical form, the result may be a reducible fraction.

### Inverse

Every rational number {{math|a/b}} has an additive inverse, often called its opposite,
- left( frac{a}{b} right) = frac{-a}{b}.
If {{math|a/b}} is in canonical form, the same is true for its opposite.A nonzero rational number {{math|a/b}} has a multiplicative inverse, also called its reciprocal,
left(frac{a}{b}right)^{-1} = frac{b}{a}.
If {{math|a/b}} is in canonical form, then the canonical form of its reciprocal is either {{tmath|frac{b}{a} }} or {{tmath|frac{-b}{-a} }}, depending on the sign of {{mvar|a}}.

### Division

If both {{math|b}} and {{math|c}} are nonzero, the division rule is
Thus, dividing {{math|a/b}} by {{math|c/d}} is equivalent to multiplying {{math|a/b}} by the reciprocal of {{math|c/d}}:

### Exponentiation to integer power

If {{math|n}} is a non-negative integer, then
left(frac{a}{b}right)^n = frac{a^n}{b^n}.
The result is in canonical form if the same is true for {{math|a/b}}.In particular,
left(frac{a}{b}right)^0 = 1.
If {{math|a â‰  0}}, then
left(frac{a}{b}right)^{-n} = frac{b^n}{a^n}.
If {{math|a/b}} is in canonical form, the canonical form of the result is frac{b^n}{a^n} if either {{math|a > 0}} or {{mvar|n}} is even. Otherwise, the canonical form of the result is frac{-b^n}{-a^n}.

## Continued fraction representation

A finite continued fraction is an expression such as
a_0 + cfrac{1}{a_1 + cfrac{1}{a_2 + cfrac{1}{ ddots + cfrac{1}{a_n} }}},
where an are integers. Every rational number a/b can be represented as a finite continued fraction, whose coefficients an can be determined by applying the Euclidean algorithm to (a,b).

## Other representations

are different ways to represent the same rational value.

## Formal construction

(File:Rational Representation.svg|thumb|right|300px|A diagram showing a representation of the equivalent classes of pairs of integers)Mathematically we may construct the rational numbers as equivalence classes of ordered pairs of integers (m,n), with {{nowrap|n â‰  0}}. This space of equivalence classes is the quotient space {{nowrap|(Z Ã— (Z {0})) / ~,}} where {{nowrap|(m1,n1) ~ (m2,n2)}} if, and only if, {{nowrap|m1n2 âˆ’ m2n1 {{=}} 0.}} We can define addition and multiplication of these pairs with the following rules:
left(m_1, n_1right) + left(m_2, n_2right) equiv left(m_1n_2 + n_1m_2, n_1n_2right) left(m_1, n_1right) times left(m_2, n_2right) equiv left(m_1m_2, n_1n_2right)
and, if m2 â‰  0, division by
frac{left(m_1, n_1right)} {left(m_2, n_2right)} equiv left(m_1n_2, n_1m_2right).
The equivalence relation (m1,n1) ~ (m2,n2) if, and only if, {{nowrap|m1n2 âˆ’ m2n1 {{=}} 0}} is a congruence relation, i.e. it is compatible with the addition and multiplication defined above, and we may define Q to be the quotient set {{nowrap|1=(Z Ã— (Z {0})) / ~,}} i.e. we identify two pairs (m1,n1) and (m2,n2) if they are equivalent in the above sense. (This construction can be carried out in any integral domain: see field of fractions.) We denote by [(m1,n1)] the equivalence class containing (m1,n1). If (m1,n1) ~ (m2,n2) then, by definition, (m1,n1) belongs to [(m2,n2)] and (m2,n2) belongs to [(m1,n1)]; in this case we can write {{nowrap|[(m1,n1)] {{=}} [(m2,n2)]}}. Given any equivalence class [(m,n)] there are a countably infinite number of representation, since
cdots = [(-2m,-2n)] = [(-m,-n)] = [(m,n)] = [(2m,2n)] = cdots.
The canonical choice for [(m,n)] is chosen so that n is positive and {{nowrap|gcd(m,n) {{=}} 1}}, i.e. m and n share no common factors, i.e. m and n are coprime. For example, we would write [(1,2)] instead of [(2,4)] or [(âˆ’12,âˆ’24)], even though {{nowrap|[(1,2)] {{=}} [(2,4)] {{=}} [(âˆ’12,âˆ’24)]}}.We can also define a total order on Q. Let âˆ§ be the and-symbol and âˆ¨ be the or-symbol. We say that {{nowrap|1=[(m1,n1)] ≤ [(m2,n2)]}} if:
(n_1n_2 > 0 and m_1n_2 le n_1m_2) or (n_1n_2 < 0 and m_1n_2 ge n_1m_2).
The integers may be considered to be rational numbers by the embedding that maps m to [(m,1)].

## Properties

(File:Diagonal argument.svg|thumb|right|170px|A diagram illustrating the countability of the positive rationals)The set Q, together with the addition and multiplication operations shown above, forms a field, the field of fractions of the integers Z.The rationals are the smallest field with characteristic zero: every other field of characteristic zero contains a copy of Q. The rational numbers are therefore the prime field for characteristic zero.The algebraic closure of Q, i.e. the field of roots of rational polynomials, is the algebraic numbers.The set of all rational numbers is countable. Since the set of all real numbers is uncountable, we say that almost all real numbers are irrational, in the sense of Lebesgue measure, i.e. the set of rational numbers is a null set.The rationals are a densely ordered set: between any two rationals, there sits another one, and, therefore, infinitely many other ones. For example, for any two fractions such that
frac{a}{b} < frac{c}{d}
(where b,d are positive), we have
frac{a}{b} < frac{ad + bc}{2bd} < frac{c}{d}.
Any totally ordered set which is countable, dense (in the above sense), and has no least or greatest element is order isomorphic to the rational numbers.

## Real numbers and topological properties

The rationals are a dense subset of the real numbers: every real number has rational numbers arbitrarily close to it. A related property is that rational numbers are the only numbers with finite expansions as regular continued fractions.By virtue of their order, the rationals carry an order topology. The rational numbers, as a subspace of the real numbers, also carry a subspace topology. The rational numbers form a metric space by using the absolute difference metric {{nowrap|d(x,y) {{=}} {{!}}x âˆ’ y{{!}},}} and this yields a third topology on Q. All three topologies coincide and turn the rationals into a topological field. The rational numbers are an important example of a space which is not locally compact. The rationals are characterized topologically as the unique countable metrizable space without isolated points. The space is also totally disconnected. The rational numbers do not form a complete metric space; the real numbers are the completion of Q under the metric {{nowrap|d(x,y) {{=}} {{!}}x âˆ’ y{{!}},}} above.

In addition to the absolute value metric mentioned above, there are other metrics which turn Q into a topological field:Let p be a prime number and for any non-zero integer a, let {{nowrap|{{!}}a{{!}}p {{=}} pâˆ’n}}, where pn is the highest power of p dividing a.In addition set {{nowrap|{{!}}0{{!}}p {{=}} 0.}} For any rational number a/b, we set {{nowrap|{{!}}a/b{{!}}p {{=}} {{!}}a{{!}}p / {{!}}b{{!}}p.}}Then {{nowrap|dp(x,y) {{=}} {{!}}x âˆ’ y{{!}}p}} defines a metric on Q.The metric space (Q,dp) is not complete, and its completion is the p-adic number field Qp. Ostrowski's theorem states that any non-trivial absolute value on the rational numbers Q is equivalent to either the usual real absolute value or a p-adic absolute value.

## References

{{Algebraic numbers}}{{Number systems}}{{Rational numbers}}

- content above as imported from Wikipedia
- "rational number" does not exist on GetWiki (yet)
- time: 8:51am EDT - Mon, Oct 15 2018
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
GETWIKI 19 AUG 2014
GETWIKI 18 AUG 2014
Wikinfo
Culture
CONNECT