Given two integers a and b, find the greatest positive integer c, such that a = m⋅c and b = n⋅c , where m and n are some other integers. (c is the greatest number that divies both a and b) Note: Greatest Common Divisor (GCD) is sometimes called Greatest Common Factor (GCF)
a = b =
GCD(a,b) =
Least Common Multiple
Given two integers a and b, find a smallest positive integer c, such that c = m⋅a and c = n⋅b , where m and n are some other integers. (c is the smallest positive number such that both a and b divide it)
a = b =
LCM(a,b) =
Number Factorization
Find prime factors of a number n (prime numbers that divide it). Then, all other factors - all different numbers that divide it, are also shown. They are all possible combinations of its prime factors Please note that negative numbers will be treated as their absolute value, that is only factors of their absolute values will be shown.
n =
Prime Factors of :
Enumerated Prime Factors of :
All Factors of :