两个整数 A 和 B 可以写成质因数分解的形式。
A =
B =
A 和 B 的最小公倍数 (LCM) 是 。
- (a)
写出 m 和 q 的值。
- (i)
答案 m = ...
- (ii)
q = ...
- (i)
- (b)
求 A 和 B 的最大公约数。
答案 ...
它不会直接告诉你答案,而是问你卡在哪一步看看 AI 是怎么陪你一步步弄懂这道题的
完整解法
4(a)(i)
1. Use the LCM exponent rule for the prime factor $3$ to find $m$.
In , the exponent of is .
The LCM is , so the exponent of in the LCM is .
Since the LCM takes the greatest exponent of each prime factor,
4(a)(ii)
1. Identify the missing prime factor contributed by $q$ in the LCM.
The LCM is , while .
Since is a prime factor in and the LCM contains the prime factor , we have
.
4(b)
1. Substitute the earlier values of $m$ and $q$, then choose the common prime factors of $A$ and $B$ with the smaller exponents.
From part (a), and .
So
and
.
Since the LCM has , and already contains , . From the given form and the LCM, the common prime factors definitely shared by and are and , with the smaller power of being .
Hence
AI 分析,可能出错
用 AI 批改,圈出写错的那一步,并自动将你的薄弱点存入错题本,形成你的错因库。