Multiplying the numerator and denominator of a fraction by the same (non-zero) number results in a fraction that is equivalent to the original fraction. This is true because for any non-zero number , the fraction equals . Therefore, multiplying by is the same as multiplying by one, and any number multiplied by one has the same value as the original number. By way of an example, start with the fraction . When the numerator and denominator are both multiplied by 2, the result is , which has the same value (0.5) as . To picture this visually, imagine cutting a cake into four pieces; two of the pieces together () make up half the cake (). Simplifying (reducing) fractions Dividing the numerator and denominator of a fraction by the same non-zero number yields an equivalent fraction: if the numerator and the denominator of a fraction are both divisible by a number (called a factor) greater than 1, then the fraction can be reduced to an equivalent fraction with a smaller numerator and a smaller denominator. For example, if both the numerator and the denominator of the fraction are divisible by then they can be written as and and the fraction becomes , which can be reduced by dividing both the numerator and denominator by to give the reduced fraction If one takes for the greatest common divisor of the numerator and the denominator, one gets the equivalent fraction whose numerator and denominator have the lowest absolute values. One says that the fraction has been reduced to its lowest terms. If the numerator and the denominator do not share any factor greater than 1, the fraction is already reduced to its lowest terms, and it is said to be irreducible, reduced, or in simplest terms. For example, is not in lowest terms because both 3 and 9 can be exactly divided by 3. In contrast, is in lowest terms—the only positive integer that goes into both 3 and 8 evenly is 1. Using these rules, we can show that , for example. As another example, since the greatest common divisor of 63 and 462 is 21, the fraction can be reduced to lowest terms by dividing the numerator and denominator by 21: The Euclidean algorithm gives a method for finding the greatest common divisor of any two integers. Comparing fractions Comparing fractions with the same positive denominator yields the same result