Friday, October 30th, 2009
Introduction to the Euclidean Algorithm
Description
A detailed tutorial on the Euclidean algorithm. Step by step tutorial including several examples of the Euclidean algorithm for reference.
Overview
The Euclidean algorithm, sometimes referred to as Euclid’s algorithm, is the most efficient way of determining the greatest common factor of two numbers. The greatest common factor of two numbers is the largest number that divides them both evenly. The Euclidean algorithm is used in a series of steps – it follows a pattern that helps to find numbers and their factors with accuracy.
Tags: algebra, algorithm, common, divides, divisor, Euclid, Euclidean, evenly, factor, greatest, highest, negative, pattern, positive, remainder, steps
Posted in Algebra | No Comments »
Thursday, October 29th, 2009
How to Identify Coprime Numbers
Description
A detailed tutorial on identifying coprime numbers. Step by step tutorial including several examples of how to identify coprime numbers for reference.
Overview
Two numbers are considered to be coprime, or relatively prime, if they have no common positive factor other than 1, or if their greatest common divisor is 1. Sometimes the notation for perpendicular is used to say that a number A is coprime to another number B. The term coprime was invented because the numbers are prime together, but are not prime themselves. A prime number can be coprime with any number.
Tags: arithmetic, common, coprime, divisor, factor, greatest, notation, number, one, perpendicular, positive, prime, relatively
Posted in Arithmetic | No Comments »
