Series route: This guide belongs to the complete PSLE Learner’s Guide volume directory. The original PSLE Learning Guide supplies the wider English, Mathematics and Science route, while PSLE Mathematics provide verified subject-specific continuation.
Find your route through this guide
This volume solves one precise learner problem: the learner sees that a whole number is divisible by a and by b, multiplies a×b automatically, and overlooks that shared prime factors must be counted once in the least common multiple rather than twice. The goal is durable control, not a remembered slogan. A Primary 6 learner should be able to identify the trigger, explain the mechanism, perform the decision under time pressure and reject an attractive answer that exceeds the evidence.
- Start with the exact mistake and the evidence boundary.
- Build the mechanism before memorising a shortcut.
- Study worked contrasts and name why the near-miss fails.
- Repair misconceptions with one targeted check each.
- Attempt graded independent practice before reading the explanations.
- Return after a delay and prove that the method transfers.
- Use the parent and tutor notes after the learner has attempted the work.
The problem beneath the mistake
If a number is divisible by 4 and by 6, it must be divisible by 12, the least common multiple of 4 and 6. It need not be divisible by 24.
The example 12 proves the boundary: 12÷4=3 and 12÷6=2, but 12÷24 is not a whole number. One counterexample defeats the automatic product rule.
The product works when the divisors have no common factor greater than 1. For example, divisibility by 4 and 5 guarantees divisibility by 20 because LCM(4,5)=4×5.
Prime factors explain why. The factorisations 4=2² and 6=2×3 overlap in one factor of 2. Their LCM needs 2²×3=12, not 2³×3=24.
The LCM is the smallest positive whole number divisible by both divisors. Every number divisible by both is a multiple of that LCM.
A common multiple larger than the LCM may also divide some particular numbers, but it is not guaranteed by the original information. Guarantee asks for what must be true in every valid case.
The rule extends to more than two divisors: collect the highest required power of each prime across all divisors. Do not multiply repeated prime requirements again.
Zero is divisible by every non-zero whole-number divisor, but many PSLE questions seek positive counts or the smallest positive value. Read the domain before selecting zero.
Units and contexts matter. A schedule repeating every 4 and 6 minutes coincides every 12 minutes under aligned starts; a quantity packed in groups of both sizes must be a multiple of 12.
The reliable routine is factor the divisors, take the highest power of each prime, build the LCM, test one smallest example and use the product only after checking common factors.
Core decision: A whole number divisible by both a and b is guaranteed to be divisible by LCM(a,b). It is guaranteed to be divisible by a×b only when a and b are coprime, because otherwise their product repeats shared prime factors.
Divisibility claims are statements about necessary factor content. Prime factorisation exposes which factors are genuinely required, while a smallest-case check prevents an unjustified stronger conclusion.
Mechanism: why the rule works
1. Translate divisibility
Write N=a×m and N=b×n for whole numbers m and n.
This identifies a and b as factor requirements of N.
Diagnostic check. What factors must N contain?
2. Factor the divisors
Express each divisor as prime powers.
Prime factors reveal overlap that ordinary multiplication hides.
Diagnostic check. Which prime requirements are shared?
3. Take highest powers
For each prime, keep the greatest exponent appearing in either divisor.
Those powers are sufficient and necessary for a common multiple.
Diagnostic check. Have any shared factors been counted twice?
4. Build the LCM
Multiply the selected prime powers.
The result is the smallest positive common multiple and therefore the guaranteed divisor.
Diagnostic check. Can both original divisors divide it?
5. Check coprimality
If the greatest common divisor is 1, the LCM equals the product.
No prime overlap means nothing is duplicated by multiplication.
Diagnostic check. Do the divisors share a factor above 1?
6. Use a counterexample
Test the LCM itself against a proposed stronger divisor.
If the LCM is not divisible by the product, the product is not guaranteed.
Diagnostic check. What is the smallest valid N?
7. Separate must from may
A particular N may contain extra factors beyond the LCM.
Extra divisibility is possible but not forced by the original conditions.
Diagnostic check. Is the question asking possible or guaranteed?
8. Return to context
Interpret the LCM as a cycle, group size or smallest positive quantity.
The arithmetic result must match the requested domain and unit.
Diagnostic check. Does zero or a starting offset change the context?
Worked examples: make the decision visible
Pause before each answer. State the controlling evidence in one line, then complete the operation. The explanations deliberately contrast a valid route with a plausible but invalid one, because transfer grows when the learner can say why a tempting route does not apply.
Worked example 1: Four and six
Task. What is guaranteed if N is divisible by 4 and 6?
Reasoning. 4=2² and 6=2×3, so LCM=2²×3=12.
Answer. N is divisible by 12.
Independent check. N=12 shows divisibility by 24 is not guaranteed.
Contrast-and-transfer pass. Keep the governing principle from “Four and six”, but change one surface detail in the task: What is guaranteed if N is divisible by 4 and 6? Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—N is divisible by 12.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 2: Four and five
Task. N is divisible by 4 and 5.
Reasoning. The divisors share no prime factor.
Answer. N is divisible by 20.
Independent check. LCM(4,5)=20=4×5.
Contrast-and-transfer pass. Keep the governing principle from “Four and five”, but change one surface detail in the task: N is divisible by 4 and 5. Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—N is divisible by 20.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 3: Six and nine
Task. 6=2×3 and 9=3².
Reasoning. Take 2×3²=18.
Answer. Divisibility by 18 is guaranteed, not 54.
Independent check. N=18 is the smallest counterexample to 54.
Contrast-and-transfer pass. Keep the governing principle from “Six and nine”, but change one surface detail in the task: 6=2×3 and 9=3². Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—Divisibility by 18 is guaranteed, not 54.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 4: Eight and twelve
Task. 8=2³ and 12=2²×3.
Reasoning. Take 2³×3=24.
Answer. Every common multiple is divisible by 24.
Independent check. 24 is not divisible by 96.
Contrast-and-transfer pass. Keep the governing principle from “Eight and twelve”, but change one surface detail in the task: 8=2³ and 12=2²×3. Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—Every common multiple is divisible by 24.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 5: Nested divisors
Task. N is divisible by 5 and 15.
Reasoning. Every multiple of 15 already contains factor 5.
Answer. The guarantee is divisibility by 15.
Independent check. LCM(5,15)=15.
Contrast-and-transfer pass. Keep the governing principle from “Nested divisors”, but change one surface detail in the task: N is divisible by 5 and 15. Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—The guarantee is divisibility by 15.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 6: Particular extra factor
Task. N=72 is divisible by 8 and 9.
Reasoning. LCM(8,9)=72, which equals the product because they are coprime.
Answer. Here product divisibility holds.
Independent check. Change to 8 and 12 to see why it is not universal.
Contrast-and-transfer pass. Keep the governing principle from “Particular extra factor”, but change one surface detail in the task: N=72 is divisible by 8 and 9. Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—Here product divisibility holds.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 7: Three divisors
Task. Find the guaranteed divisor for 4,6,9.
Reasoning. Use 2², 3 and 3²; highest powers give 2²×3².
Answer. The LCM is 36.
Independent check. 36 divides each common multiple and is divisible by all three.
Contrast-and-transfer pass. Keep the governing principle from “Three divisors”, but change one surface detail in the task: Find the guaranteed divisor for 4,6,9. Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—The LCM is 36.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 8: Schedule
Task. Two alarms ring every 4 and 6 minutes from the same start.
Reasoning. A repeat coincidence uses the LCM.
Answer. They coincide every 12 minutes.
Independent check. List multiples 4,8,12 and 6,12.
Contrast-and-transfer pass. Keep the governing principle from “Schedule”, but change one surface detail in the task: Two alarms ring every 4 and 6 minutes from the same start. Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—They coincide every 12 minutes.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 9: Zero boundary
Task. Is zero a common multiple of 4 and 6?
Reasoning. Yes, but “least positive common multiple” excludes zero.
Answer. The LCM is 12.
Independent check. Read positive and starting-time wording.
Contrast-and-transfer pass. Keep the governing principle from “Zero boundary”, but change one surface detail in the task: Is zero a common multiple of 4 and 6? Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—The LCM is 12.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
Worked example 10: Error diagnosis
Task. A pupil writes “divisible by 6 and 10, so divisible by 60”.
Reasoning. 6 and 10 share factor 2; LCM is 30.
Answer. Only divisibility by 30 is guaranteed.
Independent check. N=30 disproves the stronger claim.
Contrast-and-transfer pass. Keep the governing principle from “Error diagnosis”, but change one surface detail in the task: A pupil writes “divisible by 6 and 10, so divisible by 60”. Before recalculating or rewriting, name which evidence remains controlling and which detail has changed. The original conclusion—Only divisibility by 30 is guaranteed.—may remain valid only if the changed detail does not alter the trigger, relationship or scope. Use the independent check again rather than trusting visual similarity. This second pass trains selection: the learner must decide whether the same method still applies, adapt one step when a condition changes, and refuse the method when its trigger disappears.
The method lab: change one condition at a time
Create factor trees for six divisor pairs and circle repeated prime factors. Compare product and LCM for each pair.
Use the LCM itself as a stress test. If it fails a proposed guaranteed divisor, write the smallest counterexample clearly.
Sort pairs into coprime, overlapping and nested. State when the product rule works and why.
Model schedule coincidences with number lines, including one case with different starting times where a simple LCM interval alone does not locate the first meeting.
After a delay, reconstruct the rule from prime requirements rather than from a remembered slogan.
Common misconceptions and targeted repairs
Misconception 1: Always multiply divisors
What the learner may think. The learner treats two conditions as independent.
Why it fails. Shared prime factors are duplicated in the product.
Targeted repair. Compute the LCM first.
Misconception 2: LCM means largest common multiple
What the learner may think. The learner confuses least with greatest.
Why it fails. Common multiples continue without a greatest one.
Targeted repair. List the first few multiples.
Misconception 3: The product never works
What the learner may think. The learner overcorrects.
Why it fails. For coprime divisors, LCM equals product.
Targeted repair. Check the greatest common divisor.
Misconception 4: A particular example proves guarantee
What the learner may think. The learner finds one N divisible by the product.
Why it fails. Guarantee must hold for every valid N.
Targeted repair. Test the smallest common multiple.
Misconception 5: Zero is always the requested answer
What the learner may think. The learner ignores positive context.
Why it fails. LCM means least positive common multiple.
Targeted repair. Read the domain and unit.
Misconception 6: Starting offsets do not matter
What the learner may think. The learner applies cycle length to misaligned schedules.
Why it fails. LCM gives repeat spacing, but first coincidence may require matching phases.
Targeted repair. List early times.
Graded independent practice with explained answers
Attempt each item without looking ahead. Write the evidence or relationship before the final response. Early items check recognition; middle items require explanation; later items change the surface form so that copying a worked example is insufficient.
Practice 1: Basic
Question. LCM of 4 and 6?
Explained answer. 12.
Why this earns trust. Prime powers 2² and 3 are required.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “12.” from memory, but to recreate a justified answer from the new evidence.
Practice 2: Guarantee
Question. If N is divisible by 4 and 6, must it be divisible by 24?
Explained answer. No.
Why this earns trust. N=12 is a counterexample.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “No.” from memory, but to recreate a justified answer from the new evidence.
Practice 3: Coprime
Question. If N is divisible by 7 and 8, what product is guaranteed?
Explained answer. 56.
Why this earns trust. The divisors are coprime.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “56.” from memory, but to recreate a justified answer from the new evidence.
Practice 4: Overlap
Question. If N is divisible by 6 and 15, what is guaranteed?
Explained answer. 30.
Why this earns trust. LCM uses 2×3×5.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “30.” from memory, but to recreate a justified answer from the new evidence.
Practice 5: Nested
Question. LCM of 8 and 24?
Explained answer. 24.
Why this earns trust. The larger divisor already contains the smaller.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “24.” from memory, but to recreate a justified answer from the new evidence.
Practice 6: Three numbers
Question. LCM of 3,4,6?
Explained answer. 12.
Why this earns trust. Highest prime powers are 2² and 3.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “12.” from memory, but to recreate a justified answer from the new evidence.
Practice 7: Counterexample
Question. Disprove “divisible by 8 and 12 means divisible by 96”.
Explained answer. Use N=24.
Why this earns trust. 24 satisfies both original conditions but not 96.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “Use N=24.” from memory, but to recreate a justified answer from the new evidence.
Practice 8: Must versus may
Question. Could a common multiple of 4 and 6 be divisible by 24?
Explained answer. Yes, for example 24; it is not guaranteed.
Why this earns trust. Possibility and necessity are separated.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “Yes, for example 24; it is not guaranteed.” from memory, but to recreate a justified answer from the new evidence.
Practice 9: Schedule
Question. Cycles of 5 and 6 minutes start together. Repeat interval?
Explained answer. 30 minutes.
Why this earns trust. LCM(5,6)=30.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “30 minutes.” from memory, but to recreate a justified answer from the new evidence.
Practice 10: Prime powers
Question. LCM of 12 and 18?
Explained answer. 36.
Why this earns trust. 12=2²×3 and 18=2×3².
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “36.” from memory, but to recreate a justified answer from the new evidence.
Practice 11: Rule
Question. When does LCM equal the product?
Explained answer. When the divisors are coprime.
Why this earns trust. No prime factor overlaps.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “When the divisors are coprime.” from memory, but to recreate a justified answer from the new evidence.
Practice 12: Routine
Question. State the sequence.
Explained answer. Factor, take highest powers, form LCM, test the smallest case, check context.
Why this earns trust. The guarantee and its boundary are both checked.
Transfer variation. Close the answer, wait several minutes, and rebuild the reasoning with different names, values or wording while preserving the same decision. Start by stating the evidence that activates the method; then produce the response and a separate check. If the new surface detail changes the governing condition, explain why the earlier answer pattern must not be copied. The aim is not to repeat “Factor, take highest powers, form LCM, test the smallest case, check context.” from memory, but to recreate a justified answer from the new evidence.
A four-session mastery cycle
Session 1: construct. Read the mechanism once, cover it and write a three-line model containing the trigger, the operation and the check. Add one example and one near-miss. Compare only after the model is complete. If the operation is right but the trigger is missing, the knowledge is unsafe because it may be applied in the wrong place.
Session 2: discriminate. Mix six items: two that clearly require this method, two that tempt the method but violate a condition, and two that require another skill. For every item, write “use” or “do not use” before answering. Accuracy in method selection matters more than speed at this stage.
Session 3: explain. Give a complete answer to an imagined classmate. Include the smallest sufficient evidence, the mechanism and the independent check. Remove any sentence that merely repeats the question or adds an unsupported claim. A concise causal explanation is stronger than a longer collection of familiar words.
Session 4: perform. Attempt a timed mixed set without notes. Mark uncertain decisions, but continue. During review, classify each error as trigger, evidence, operation, scope, unit or check. Reattempt one changed version after a delay. Mastery is shown when the learner chooses and adapts the method without needing the original example beside it.
Delayed transfer: prove that the learning lasts
Transfer test 1: New divisor set
Find guarantees for three unfamiliar divisors.
Success criterion. Highest prime powers are justified.
Transfer test 2: Counterexample design
Create the smallest counterexample to an automatic-product claim.
Success criterion. It satisfies all original conditions.
Transfer test 3: Schedule offset
Compare aligned and shifted cycles.
Success criterion. Interval and first coincidence are separated.
Transfer test 4: Delayed proof
Explain why overlap prevents the product guarantee after one week.
Success criterion. The explanation uses prime factors, not authority.
Examination control
1. Name the target. State exactly what the question asks before selecting a rule or explanation.
2. Expose the relationship. Write the grammatical, numerical, causal or representational relationship that controls the answer.
3. Use decisive evidence. Choose the smallest fact, calculation or observation that settles the decision.
4. Check the boundary. Reject the nearest tempting claim that the evidence does not support.
5. Present precisely. Keep conditions, units, certainty and scope visible in the final response.
Under time pressure, compress the method to factor divisors → highest prime powers → LCM → smallest-case test → product only if coprime → context. The compressed routine is useful only after the full reasoning is understood. If it produces uncertainty, expand the step instead of guessing.
A compact error log
Use labels such as product assumed, shared factor double-counted, least misread, possibility called guarantee, zero/domain error or schedule offset ignored.
Review with one nested pair, one coprime pair and one overlapping pair so the rule discriminates rather than overgeneralises.
Notes for parents and tutors
Use multiplication lists before prime notation when the learner needs a concrete entry point.
Ask for the smallest valid number to expose overclaims quickly.
Praise counterexamples that satisfy every original condition.
Connect LCM to real cycles only after checking whether starts are aligned.
Frequently asked questions
What is always guaranteed?
Divisibility by the LCM.
Why not always the product?
Shared prime factors may be counted twice.
When does product work?
When the divisors are coprime.
Best counterexample?
Often the LCM itself.
LCM of nested divisors?
The larger divisor.
Can zero be a common multiple?
Yes, but LCM is least positive.
What about three divisors?
Take the highest power of every prime across all three.
Fastest check?
Compute LCM and test whether it equals the product.
Next routes
Return to the complete volume directory to locate the series, use the original PSLE Learning Guide for the foundation route, and continue through PSLE Mathematics for verified subject guidance. The next useful task is a mixed set in which this idea is sometimes relevant and sometimes irrelevant; that is where the learner must choose a method rather than imitate one.