Posts Tagged ‘divides’
Tuesday, November 17th, 2009
Definition of a Bisector
Description
A detailed tutorial on the definition of a bisector. Step by step tutorial including several examples of bisectors for reference.
Overview
A bisector is any line that evenly divides a symmetrical shape or object. The only difference between the bisector and the test for symmetry is that when testing for symmetry, the line is not really there. A bisector is really there. The most common kind of bisector is an angle bisector. In order to remember bisectors, think of them as perpendicular lines that cross right in the middle.
Tags: angle, bisector, cross, divides, evenly, Geometry, line, middle, object, perpendicular, shape, symmetrical, symmetry, test
Posted in Geometry | No Comments »
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
Overview of Transitive Relations
Description
A detailed tutorial on the property of transitive relations. Step by step tutorial including several examples of transitive relations for reference.
Overview
A transitive relation can be mathematically defined as for all x and y belonging to A, if x R y, then y R x. In this statement, A is a set, and R is a relation of that set. An empty set is considered to be transitive. Since a transitive relation is defined by a conditional sentence, a proof for the transitive property of relations would be written as a direct proof.
Tags: conditional, direct, discrete math, divides, empty, equal, equivalence, great, greater, implies, proof, property, r, relation, set, subset, transitive, x, y, z
Posted in Discrete Math | No Comments »
