Let A. B Element Z. Knowledge of the prime power factorization for A and 13 simp

Question

Let A. B Element Z. Knowledge of the prime power factorization for A and 13 simplifies many types of computation. Let: A = p^a_1 _1 P^a_m _m and B = p^b_1 _1 P^b_m _m. where p_1, ..., p_m are distinct primes and a_1, ...a_m b_1, ..., b_m are non-negative integers (zero is allowed, so it is not exactly a prime power factorization, but very close). Using expressions for A and B above: Write a similar expression for A middot B. Write a condition for B | A. Assuming that B | A find a similar expression for A/B. Find an expression for gcd(A, B). Find an expression for lcm(A, B).

Explanation / Answer

(1) A.B = p1a1+b1p2a2+b2.......pmam+bm

(2) If a1 >= b1, a2 >=b2.....am>=bm, then B|A.

(3) A/B = p1a1-b1p2a2-b2.......pmam-bm

(4) Since all factors are primes, they all divide A and B. The gcd depends on whichever is smaller, a or b.

If a is greater, the gcd has power b. Else the gcd has power a.

The smallest of two numbers a and b

= [ (a+b) - |(a-b)| ] / 2

where |(a-b)| is the absolute (positive or zero) value of a-b.

=> gcd(A,B) = p1[ (a1+b1) - |(a1-b1)| ] / 2.......pm[ (am+bm) - |(am-bm)| ] / 2

(As per Chegg policy only four sub questions will be answered. You need to post a new question for the fifth answer. Or you can follow the method used to find gcd.)

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.