MHB -c6. Find the GCF and the LCF of A and B.

  • Thread starter Thread starter karush
  • Start date Start date
karush
Gold Member
MHB
Messages
3,240
Reaction score
5
Find the greatest common factor and the least common multiple of A and B.
Write your answers as a product of powers of primes in increasing order.
$A=2^3 3 \cdot 5^3 \cdot 11^2 \cdot 13 $
$B = 2 \cdot 3^3 \cdot 7^3 \cdot 11^2 \cdot 13^3 $
$GCF(A,B) = \boxed{?}$
$LCM(A,B) = \boxed{?}$

ok apparently this is just by observation
but its kinda subtle so I went with $GCF(A,B) = \boxed{11^2}$ $LCM(A,B) = \boxed{2}$
hopefully
 
Mathematics news on Phys.org
I am afraid you are misunderstanding "greatest common factor". That is not a single prime that is in both numbers, it is the largest number that evenly divides both. I see that A has [math]2^3[/math] as a factor and B has 2 as a factor so the GCF has 2 as a factor. A has 3 as a factor and B has [math]3^3[/math] so the GCF has 3 as a factor. A has [math]5^3[/math] as a factor but B does not have a power of 5 as a factor so the GCF does not have a power of 5 as a factor. B has [math]7^3[/math] as a factor but A does not have a power of 7 as a factor so the GCF does not have a power of 7 as a factor. Both A and B have [math]11^2[/math] as a factor so the GCF has [math]11^2[/math] as a factor. A has 13 as a factor and B has [math]13^3[/math] as a factor so the GCF has13 as a factor.

The GCF is [math](2)(3)(11^2)(13)[/math]

For the GCF we took the lowest power of each prime. For the LCM (least common multiple) take the highest power. The LCM of A and B is [math](2^3)(3^3)(5^3)(7^3)(11^2)(13^3)[/math].
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top