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 notices that primes often sit beside multiples of 6 and then wrongly assumes every number in those positions is prime. The aim is not to memorise a slogan. It is to understand the mechanism well enough to recognise the idea when the wording, numbers, diagram or context changes. A Primary 6 learner should be able to explain the decision, perform it under time pressure, and detect a tempting answer that only looks familiar.
- Understand the mechanism before memorising a form.
- Study the worked examples and compare near-misses.
- Repair common misconceptions with targeted tests.
- Complete graded independent practice before reading the answers.
- Use delayed transfer and examination control to make the skill durable.
- Use the parent and tutor notes only after the learner has attempted the work.
The current official SEAB page for PSLE formats examined in 2026 is the primary route for format-specific information. This article teaches a reasoning habit rather than predicting a particular question. If a school instruction or an official paper direction differs from a practice routine here, follow the instruction printed for that task.
The problem beneath the mistake
Write whole numbers in blocks of six. Every number has remainder 0, 1, 2, 3, 4 or 5 after division by 6. Four of those positions are automatically divisible by 2 or 3. A prime greater than 3 therefore has only two possible positions left: one above a multiple of 6 or one below the next multiple.
This is a filtering rule, not a complete prime test. Twenty-five is one more than 24 and has the form 6k+1, yet 25=5×5. Thirty-five is one less than 36 and has the form 6k−1, yet 35=5×7. The rule removes impossible prime candidates; it does not certify the survivors.
The deeper lesson is logical direction. “Prime greater than 3 implies 6k±1” is true. Reversing it gives a false converse. Learners should use the pattern to narrow a search, then test remaining factors up to the square root or use the method required by the task.
Core decision: Every prime number greater than 3 has remainder 1 or 5 when divided by 6, but a number with remainder 1 or 5 may still be composite.
A useful rule has three parts: a trigger, an operation and a check. The trigger tells you when the rule applies. The operation tells you what to do. The check tells you whether the result still matches the meaning of the question. Learners who remember only the operation often apply it in the wrong place; learners who remember only an example often freeze when the surface details change.
Mechanism: why the rule works
1. Division by six creates six remainder classes
Any whole number n can be written as 6k+r where r is 0,1,2,3,4 or 5.
Diagnostic question: What remainder remains after grouping in sixes? Reliable response: Place the number into one of six classes.
2. Even classes cannot hold large primes
Remainders 0, 2 and 4 give even numbers. Any such number greater than 2 has factor 2 and is composite.
Diagnostic question: Is the candidate even and greater than 2? Reliable response: Reject it as prime.
3. The remainder-three class is divisible by three
Numbers 6k+3 equal 3(2k+1). Any one greater than 3 has factor 3 and is composite.
Diagnostic question: Does division by 6 leave remainder 3? Reliable response: Reject it when above 3.
4. Only remainders one and five survive
Remainder 1 gives 6k+1; remainder 5 can be written 6(k+1)−1. These positions avoid automatic divisibility by 2 and 3.
Diagnostic question: Is the number adjacent to a multiple of 6? Reliable response: Keep it as a candidate, not a confirmed prime.
5. Other factors can still divide
Avoiding factors 2 and 3 does not avoid 5, 7, 11 or their products. Composite survivors explain why the converse fails.
Diagnostic question: Could a larger prime factor divide the candidate? Reliable response: Continue factor testing.
6. Small primes are exceptions to the wording
Two and three are prime but are excluded by “greater than 3.” The domain condition prevents the divisibility eliminations from rejecting the divisors themselves.
Diagnostic question: Does the statement include its lower bound? Reliable response: Handle 2 and 3 separately.
Worked examples: make the decision visible
Do not race through these examples. Before reading each explanation, name the evidence that matters and the information that does not. Then compare the correct route with the tempting route. That comparison is where the transferable learning sits.
Worked example 1: Prime thirteen
Task. Show how 13 fits the rule.
Reasoning. 13=12+1=6×2+1. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. Thirteen has form 6k+1 and is a valid prime candidate; factor checking confirms it is prime.
Independent check. Its positive factors are 1 and 13. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Worked example 2: Prime seventeen
Task. Show how 17 fits the rule.
Reasoning. 17=18−1=6×3−1. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. Seventeen has form 6k−1 and is prime.
Independent check. It is not divisible by 2, 3 or any required smaller prime factor. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Worked example 3: Composite twenty-five
Task. Does the rule prove 25 is prime?
Reasoning. 25=24+1=6×4+1, so it passes the filter but 25=5×5. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. No. It is composite despite having form 6k+1.
Independent check. The factor pair supplies a counterexample to the converse. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Worked example 4: Composite thirty-five
Task. Classify 35.
Reasoning. 35=36−1, so it has the candidate form, but 35=5×7. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. Thirty-five is composite.
Independent check. A candidate position is necessary for primes above 3, not sufficient. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Worked example 5: Automatic rejection
Task. Can 44 be prime?
Reasoning. 44=6×7+2 and is even. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. No. It is divisible by 2.
Independent check. The remainder class exposes the factor immediately. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Worked example 6: Remainder three
Task. Can 57 be prime?
Reasoning. 57=6×9+3=3×19. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. No. It is divisible by 3.
Independent check. Digit sum 12 provides an independent divisibility check. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Worked example 7: Small exception
Task. Why does 3 not have form 6k±1 for non-negative k in the intended list?
Reasoning. The theorem is restricted to primes greater than 3 because 3 itself is the factor used to eliminate the remainder-three class. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. Three is prime and is handled separately.
Independent check. Read the full domain before applying the rule. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Worked example 8: Candidate search
Task. List candidates between 30 and 50 before testing primality.
Reasoning. Numbers adjacent to multiples of 6 are 31,35,37,41,43,47,49. The controlling idea is the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors. This prevents a learner from choosing an answer merely because one word, number or observation resembles a remembered example.
Answer. After factor tests, 31,37,41,43 and 47 are prime; 35 and 49 are composite.
Independent check. The filter reduced work without replacing proof. A good check approaches the conclusion from a different direction. Repeating the same steps more slowly may repeat the same hidden assumption.
Deepening lab: compare cases, conditions and limits
A method becomes independent when you can say where it applies, where it stops and which change would alter the conclusion. The cases below deliberately vary one structural feature at a time. For each case, pause before the analysis and predict whether the core rule remains available. Then name the exact condition that controls the decision. This is harder than repeating a worked solution, but it is also closer to what an unfamiliar examination item demands.
Deepening case 1: Remainder table
Case. A table lists 6k through 6k+5.
Analysis. Classes 0,2,4 are even; class 3 is divisible by 3; classes 1 and 5 remain. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Annotate each rejected class with its factor. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 2: Negative-looking form
Case. A number is written 6k−1.
Analysis. For k≥1 this is the same remainder-five class. The minus sign does not mean the number is negative. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Rewrite 29 in both adjacent-multiple language and remainder language. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 3: Square composite
Case. Forty-nine equals 48+1.
Analysis. It passes the 6k+1 filter but equals 7². Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Use it as a clean converse counterexample. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 4: Product of candidates
Case. Two numbers each have form 6k±1.
Analysis. Their product also lands in a ±1 remainder class, which helps explain why many composites survive. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Multiply 5 and 7 and identify the class. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 5: Prime pair
Case. Eleven and thirteen lie on either side of 12.
Analysis. Both are candidates and both happen to be prime, but adjacency alone does not prove a twin-prime pair. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Compare numbers beside 24. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 6: Factor-testing limit
Case. A candidate n has no prime factor at or below √n.
Analysis. Then it cannot have a larger factor pair without a smaller partner, so it is prime. This is a separate certification step. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Apply the idea to 47. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 7: Remainder language
Case. A calculator gives remainder 5 on division by 6.
Analysis. The number can be written as one less than a multiple of 6. It remains only a prime candidate. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. State the strongest justified conclusion. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 8: Converse structure
Case. A learner reverses “if prime, then candidate” to “if candidate, then prime.”
Analysis. A true implication need not have a true converse. One composite candidate disproves the reversal. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Name 25 and explain both directions. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 9: Large-number screening
Case. A list contains 1001, 1003, 1005 and 1007.
Analysis. The 6-class test can reject some quickly, but surviving candidates still require factor checks. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Calculate each remainder without claiming primality too early. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Deepening case 10: Domain change
Case. The statement is applied to all integers including negatives.
Analysis. Remainder conventions require care, while primality is normally defined for positive integers greater than 1 in school mathematics. Notice that the answer depends on the remainder after division by 6 and the separate requirement that a prime have exactly two positive factors; changing a decorative detail would not be enough to change the reasoning.
Challenge. Restate the theorem in its intended domain. State the conclusion in one precise sentence, then add one sentence that names the evidence or relationship that makes it valid.
Finish the lab with a blank-page recall. Write the rule, its conditions, one confirming example, one near-miss and one independent check from memory. Compare that page with the article only after finishing. If the rule is correct but the condition is missing, the learning is not yet safe: an overgeneralised rule can produce confident errors. If the condition is correct but no example can be generated, practise construction rather than rereading.
Common misconceptions and targeted repairs
Misconception 1: Candidate means prime
What the learner may think. Every 6k±1 number is prime.
Why it fails. Twenty-five, thirty-five and forty-nine are composite counterexamples. The error feels efficient because it removes a decision, but it also removes the evidence boundary that makes the answer valid.
Targeted repair. Call the form a filter. Use this short test immediately: Have all possible factors been excluded?
Misconception 2: All primes follow without exception
What the learner may think. Two and three must fit the same pattern.
Why it fails. The theorem explicitly concerns primes greater than 3. The error feels efficient because it removes a decision, but it also removes the evidence boundary that makes the answer valid.
Targeted repair. State the domain first. Use this short test immediately: Is the prime above 3?
Misconception 3: Remainder five is not minus one
What the learner may think. 6k+5 and 6k−1 are unrelated.
Why it fails. 6k+5=6(k+1)−1. The error feels efficient because it removes a decision, but it also removes the evidence boundary that makes the answer valid.
Targeted repair. Use the next multiple of 6 as reference. Use this short test immediately: Which multiple lies one above?
Misconception 4: Not divisible by two or three proves prime
What the learner may think. Avoiding 2 and 3 is enough.
Why it fails. Other factors may divide. The error feels efficient because it removes a decision, but it also removes the evidence boundary that makes the answer valid.
Targeted repair. Continue with prime factors up to the necessary limit. Use this short test immediately: Does 5 or 7 divide it?
Misconception 5: The pattern creates primes
What the learner may think. Being near a multiple of 6 causes primality.
Why it fails. The pattern only records which remainder classes avoid automatic factors. The error feels efficient because it removes a decision, but it also removes the evidence boundary that makes the answer valid.
Targeted repair. Separate necessary position from factor definition. Use this short test immediately: How many positive factors remain?
Misconception 6: One example proves the converse
What the learner may think. Because 13 fits and is prime, every fitting number is prime.
Why it fails. Examples cannot prove a universal converse and counterexamples refute it. The error feels efficient because it removes a decision, but it also removes the evidence boundary that makes the answer valid.
Targeted repair. Search for a composite survivor. Use this short test immediately: What happens at 25?
Graded independent practice
Attempt each item without looking ahead. Write one line that identifies the controlling evidence before writing the final answer. Items 1–3 check recognition, 4–7 require explanation, and the later items change the surface form so that memory alone is insufficient.
Practice 1: Recognition
Question. Write 19 in 6k±1 form.
Explained answer. 19=6×3+1.
Why this answer earns trust. It is one above 18. Transfer variation: Confirm primality separately.
Practice 2: Recognition
Question. Write 23 in the form.
Explained answer. 23=6×4−1.
Why this answer earns trust. It is one below 24. Transfer variation: Give its remainder after division by 6.
Practice 3: Filter
Question. Can 33 be prime?
Explained answer. No. 33=6×5+3 and is divisible by 3.
Why this answer earns trust. Its remainder class supplies a factor. Transfer variation: Use digit sum as a check.
Practice 4: Counterexample
Question. Give a composite number of form 6k+1.
Explained answer. 25=6×4+1=5².
Why this answer earns trust. It disproves the converse. Transfer variation: Give another example.
Practice 5: Counterexample
Question. Give a composite number of form 6k−1.
Explained answer. 35=6×6−1=5×7.
Why this answer earns trust. The candidate class includes composites. Transfer variation: Find one above 50.
Practice 6: Small primes
Question. Why are 2 and 3 excluded?
Explained answer. They are the prime divisors used to eliminate the other remainder classes, so the statement starts above 3.
Why this answer earns trust. The condition prevents false rejection. Transfer variation: State the theorem fully.
Practice 7: Candidate list
Question. List candidates from 60 to 75.
Explained answer. 61,65,67,71,73.
Why this answer earns trust. They lie one above or below multiples of 6. Transfer variation: Identify which are composite.
Practice 8: Logic
Question. Is “6k±1 implies prime” true?
Explained answer. No.
Why this answer earns trust. Necessary form does not certify primality. Transfer variation: Write the valid implication direction.
Practice 9: Certification
Question. After 6k±1 screening, what must still be done?
Explained answer. Test divisibility by relevant primes or use another valid prime test.
Why this answer earns trust. The definition requires exactly two positive factors. Transfer variation: Check 49.
Practice 10: Explanation
Question. Explain the rule from remainder classes.
Explained answer. All whole numbers are 6k+r; classes 0,2,4 are even and class 3 is divisible by 3, leaving only 1 and 5 for primes above 3.
Why this answer earns trust. The proof covers every class. Transfer variation: Present it without listing primes.
Delayed transfer: prove that the learning lasts
Transfer test 1: Mixed candidate audit
Screen thirty consecutive numbers, then certify the surviving candidates. Do this after a delay, without rereading the worked examples. The purpose is to test retrieval and decision-making, not immediate imitation.
Success criterion. Keep filtering separate from proof. If the criterion is not met, return to the smallest missing decision rather than repeating the entire chapter.
Transfer test 2: Converse transfer
Find another true statement whose converse is false. Do this after a delay, without rereading the worked examples. The purpose is to test retrieval and decision-making, not immediate imitation.
Success criterion. State both directions and a counterexample. If the criterion is not met, return to the smallest missing decision rather than repeating the entire chapter.
Transfer test 3: Delayed proof
Rebuild the six remainder classes after two days. Do this after a delay, without rereading the worked examples. The purpose is to test retrieval and decision-making, not immediate imitation.
Success criterion. Explain every rejected class and the greater-than-three condition. If the criterion is not met, return to the smallest missing decision rather than repeating the entire chapter.
Examination control
1. Read the job before the story. Underline the command and the noun it governs. “Explain the change,” “state the word,” “find the fraction” and “identify the evidence” are different jobs even when the surrounding context is similar.
2. Separate given information from remembered information. Use only the facts supplied for the current task plus secure subject knowledge. Do not let a previous question, a familiar worksheet or an expected pattern silently become new evidence.
3. Write enough working to expose the decision. A marker or teacher should be able to see the relationship that justifies the answer. Extra sentences are not automatically stronger; the strongest working is concise, relevant and checkable.
4. Reserve a different-route check. For language, read the sentence for meaning and grammar. For mathematics, estimate or reverse the operation. For science, check the claim against the stated observation and a conservation or fair-test principle.
5. Stop when the requested job is complete. Unrequested speculation can contradict a correct answer. Add detail only when it explains the mechanism or satisfies another explicit part of the question.
Under time pressure, use a compact four-part margin routine: trigger → evidence → operation → check. Trigger names the feature that activates the method. Evidence identifies the exact words, values or observations allowed. Operation performs the language, mathematical or scientific step. Check asks whether the final statement answers the requested job, preserves units or referents, and avoids a stronger claim than the evidence supports.
A compact error log
After practice, do not record only “careless mistake.” Name the broken decision. Useful labels include trigger missed, evidence imported, relationship reversed, referent lost, unit dropped, operation correct but job wrong, and check repeated the same route. Add one prevention cue beside the label. A short accurate log is more useful than a long emotional account because it tells the learner what to do on the next item.
Review the log after two days and again after a week. Reattempt only one or two representative items first. If the method transfers, move to a mixed set. If it fails, repair the exact link between trigger and operation. This spacing matters because a solution can feel obvious while it is still visible and disappear when the page is closed.
Notes for parents and tutors
Use counters arranged in rows of six. Mark each position and let the learner see why four columns always carry a factor 2 or 3.
Insist on the phrase “prime candidate.” This small vocabulary control prevents the filter from becoming an invalid test.
A tutor should pair every successful prime example with a composite survivor such as 25, 35 or 49. Contrast teaches the direction of implication.
The adult’s most useful question is not “Why were you careless?” but “Which decision did the evidence require?” Ask the learner to point to the controlling word, value, relationship or observation. If the learner can explain that link, reduce support. If the learner cannot, model one example and then change the surface details for the next attempt.
Frequently asked questions
Does every prime number have form 6k±1?
Every prime greater than 3 does; the primes 2 and 3 are handled separately.
Is every 6k±1 number prime?
No. For example, 25=6×4+1 and is composite.
Why are the other classes rejected?
They are divisible by 2 or 3 when greater than those primes.
What does ± mean here?
One more than or one less than a multiple of 6.
What is the rule good for?
It quickly removes impossible prime candidates and reduces later factor testing.
What must I do after screening?
Use a valid factor or primality test on each survivor.
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 the point at which a learner must choose, not merely copy.