FACTOID # 3: South Carolina has the highest rate of violent crimes and aggravated assaults per capita among US states.

 Home Encyclopedia Statistics States A-Z Flags Maps FAQ About

 WHAT'S NEW

SEARCH ALL

Search encyclopedia, statistics and forums:

(* = Graphable)

Encyclopedia > Irreducible fraction

An irreducible fraction (or fraction in lowest terms) is a vulgar fraction in which the numerator and denominator are smaller than those in any other equivalent fraction. In arithmetic, a vulgar fraction (or common fraction) consists of one integer divided by a non-zero integer. ... In algebra, a vulgar fraction consists of one integer divided by a non-zero integer. ... In algebra, a vulgar fraction consists of one integer divided by a non-zero integer. ...

Stating it more formally, a fraction ab is irreducible if there is no other equivalent fraction cd with c having an absolute value less than the absolute value of a (where a, b, c, and d are all integers). In mathematics, the absolute value (or modulus[1]) of a real number is its numerical value without regard to its sign. ...

For example, 14, 56, and -101100 are all irreducible fractions. On the other hand, 24 is not irreducible since it is equal in value to 12, and the numerator of the latter (1) is less than the numerator of the former (2).

It can be shown that a fraction ab is irreducible if, and only if, a and b are coprime (relatively prime), that is, if a and b have a greatest common divisor of 1. Coprime - Wikipedia /**/ @import /skins-1. ... In mathematics, the greatest common divisor (gcd), sometimes known as the greatest common factor (gcf) or highest common factor (hcf), of two non-zero integers, is the largest positive integer that divides both numbers without remainder. ...

A fraction that is not irreducible can be reduced by using the Euclidean algorithm to find the greatest common divisor of the numerator and the denominator, and then dividing both the numerator and the denominator by it. In number theory, the Euclidean algorithm (also called Euclids algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). ...

Results from FactBites:

 Irreducible fraction - definition of Irreducible fraction in Encyclopedia (198 words) An irreducible fraction is a fraction a/b, where the numerator a is an integer and the denominator b is a positive integer, such that there is not another fraction c/d with c smaller in absolute value than a and 0integers, that represents the same number. To say that a fraction is irreducible and to say that it is in lowest terms are synonymous. A fraction that is not irreducible can be reduced by using the Euclidean algorithm to find the greatest common divisor of the numerator and the denominator, and then dividing both the numerator and the denominator by the greatest common divisor.
More results at FactBites »

Share your thoughts, questions and commentary here