A "Common Factor" of two (or more) integers is any integer that will divide into each of them. Thus a common factor of $a$ and $b$ is a divisor of each of them. By default, and by convention, we usually ask for positive common factors, but negative numbers can also be common factors.

When we work with Complex Numbers there is not concept of positive and negative.

Trivially, 1 is always a common factor of any collection of integers.

Examples:

When cancelling fractions we try to find a common factor of both the numerator and denominator, and then divide each by that common factor.

For two given numbers there is also a Highest Common Factor (HCF), which can be found by using the Euclidean Algorithm.


This is related to:
EquivalentFractions
Euclid
EuclideanAlgorithm
LeastCommonMultiple
ReducingFractionsToLowestTerms
(none) Adding2DVectors
AddingRationalNumbers
ComplexConjugate
ComplexNumber
DividingComplexNumbers
SubtractingComplexNumbers
WhatIsATopic
CancellingFractions
CommonMultiple
HighestCommonFactor
AddingComplexNumbers
AddingFractions
Admin_ProjectFrontEnd
MultiplyingComplexNumbers
WhatIsThisAbout

You are here

CommonFactor
ComplexNumber
Denominator
Divisor
EuclideanAlgorithm
Integer
Numerator
LeastCommonMultiple
ReducingFractionsToLowestTerms
(none) AddingComplexNumbers
ArgandDiagram
CategoryMetaTopic
ComplexConjugate
ComplexPlane
ContinuedFraction
DividingComplexNumbers
Euclid
Euler
ImaginaryNumber
ModuloArithmetic
MultiplyingComplexNumbers
PolarRepresentationOfAComplexNumber
PrimeNumber
RationalNumber
RealNumber
SquareRoot

Local neighbourhood - D3


Last change to this page
Full Page history
Links to this page
Edit this page
  (with sufficient authority)
Change password
Recent changes
All pages
Search