026Mathematics · Algebra

Find the third monomial from HCF and LCM

Find the third monomial from HCF and LCM

Find the third monomial from HCF and LCM · A:0/1,B:0/1,C:0/1,D:0/1

  • 372 bytes
  • REG Lin mode
01

Worked examples

Example 1

In a card game, each of three cards carries a monomial. Two face-up cards show a³b²c and ab⁴c³. The face-down card is known to make the HCF of the three cards ab²c and their LCM a³b⁵c³. Four players each name one of the options below for the face-down card. Which options could be correct? (There may be more than one.)

  1. A.a²b⁵c
  2. B.ab⁵c⁴
  3. C.a³b⁵c²
  4. D.b⁵c²
Answer
A and C — a²b⁵c or a³b⁵c²
Standard solution (without a calculator)
  1. Set up: let the face-down card be aʳbˢcᵘ; every coefficient is 1, so only the powers matter.
  2. Power of b: the given powers are 2 and 4. The LCM has b⁵, which neither face-up card reaches, so max(2, 4, s) = 5 forces s = 5; the HCF power 2 still comes from b².
  3. Powers of a and c: for a the given powers 3 and 1 already give smallest 1 and largest 3, so 1 ≤ r ≤ 3; r = 0 is not allowed, because the HCF would then have no a. For c the given powers 1 and 3 already give smallest 1 and largest 3, so 1 ≤ u ≤ 3.
  4. Check the options: A = a²b⁵c and C = a³b⁵c² both have s = 5 and r, u from 1 to 3, so both fit. B contains c⁴, which would make the LCM contain c⁴; D contains no a, which would remove a from the HCF. Answer: A and C.
Do it on the calculator

Example 2

R is a monomial in x and y. The HCF of 12x²y, 18xy³ and R is 6xy, and their LCM is 72x³y³.
(a) Which of the following can be R?
(b) Find the smallest possible positive coefficient of R.

  1. A.24x³y²
  2. B.36x³y
  3. C.72x²y³
  4. D.48x³y
Answer
(a) A — 24x³y² (b) 24
Standard solution (without a calculator)
  1. Set up: let R = k·xʳyˢ with k a positive whole number.
  2. Powers: for x the given powers 2 and 1 give smallest 1 but not the largest 3, so r = 3; this rules out C. For y the given powers 1 and 3 already give smallest 1 and largest 3, so 1 ≤ s ≤ 3.
  3. Coefficient: HCF(12, 18) = 6 and LCM(12, 18) = 36. We need HCF(6, k) = 6 and LCM(36, k) = 72, so k is a multiple of 6, a factor of 72 and a multiple of 8: k = 24 or 72.
  4. Check the options: B has k = 36, giving LCM 36 ≠ 72; D has k = 48, giving LCM(36, 48) = 144 ≠ 72. A = 24x³y² has k = 24, r = 3 and s = 2, so it fits. (b) The smallest possible coefficient is 24.
Do it on the calculator

Example 3

Three polynomials have HCF 3(t − 1)(t + 2)² and LCM 30(t − 1)⁴(t + 2)⁵(t² + 1)³. Two of them are 3(t − 1)²(t + 2)⁴(t² + 1) and 15(t − 1)⁴(t + 2)²(t² + 1)³. Which of the following can be the third polynomial?

  1. A.6(t−1)(t+2)⁵(t²+1)
  2. B.3(t−1)(t+2)⁵
  3. C.6(t−1)²(t+2)⁵
  4. D.6(t−1)(t+2)⁵
Answer
D — 6(t − 1)(t + 2)⁵
Standard solution (without a calculator)
  1. Treat factors like letters: let U = t − 1, V = t + 2 and W = t² + 1; no two of them share a non-constant factor. The given polynomials are 3U²V⁴W and 15U⁴V²W³, the HCF is 3UV² and the LCM is 30U⁴V⁵W³. Let the third be k·UʳVˢWᵘ.
  2. Powers: the HCF has U¹ but the given powers are 2 and 4, so r = 1. The LCM has V⁵ but the given powers are 4 and 2, so s = 5. The HCF has no W but the given powers are 1 and 3, so u = 0.
  3. Coefficient: HCF(3, 15, k) = 3 needs k to be a multiple of 3; LCM(3, 15, k) = 30 needs k to be a factor of 30 that contains the factor 2. So k = 6 or 30.
  4. Check the options: A contains W, so the HCF would contain W; B has k = 3, so the LCM coefficient would be only 15; C contains U², so the HCF would contain U². D = 6UV⁵ meets every condition. Answer D.
Do it on the calculator
02

When to use it

For questions like “P, Q and R have HCF H and LCM L; which option can be R?”. R fits only when, for every letter, the smallest of the three powers equals the power in H and the largest equals the power in L, and the HCF and LCM of the three coefficients equal the coefficients of H and L.

Code each expression

  • Fix an order of at most three letters or factors, e.g. x, y, z. Code = the coefficient followed by the three powers as single digits: x³y²z → 1321, 15(t−1)⁴(t+2)²(t²+1)³ → 15423.
  • Fill unused places with 0 (6xy with order x, y → 6110) and write a constant k as k000. An unwritten coefficient is 1.

Enter and read

  • A?: first given expression P; B?: second given expression Q; C?: the HCF; D?: the LCM. Then at each X? enter option A, B, C and D in turn.
  • After each option the screen shows 1 (it gives both the HCF and the LCM) or 0 (at least one fails). Press EXE after the first three results; the result for option D is the final screen.

Question types

  • Original practice for HKDSE Mathematics Compulsory Part: multiple-choice questions on the HCF and LCM of monomials or factorised polynomials where one of three expressions is unknown.

Before you start

  • Create the program in REG Lin (not COMP) in an empty P1 with at least 372 bytes free. Running it clears any statistical data already stored and overwrites A, B, C, D, X, Y, M and Ans; the display is reset to Norm 1. Afterwards press MODE1 to return to COMP.
  • Coefficients must be whole numbers from 1 to 9999 and each power a single digit 0–9, so complete codes lie from 1000 to 9999999. A power of 10 or more cannot be coded, and negative, fractional or decimal coefficients are not accepted. The program does not check the format.
  • Factorise polynomials fully first. Move numerical factors into the overall coefficient (2t + 2 = 2(t + 1)), write each factor with the same sign form, and keep at most three factors that share no non-constant common factor, in the same order throughout.
  • Type every code in full before EXE. A blank EXE reuses the value left in the variable, not 0; the number shown under X? is a leftover working value.
  • More than one option can show 1. If the question is known to have a single answer, you may stop with AC at the first 1; otherwise check all four options.
  • This is a checking tool. With eight entries it is not necessarily faster than comparing the smallest and largest powers by hand.

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.

Checking access…

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.