Learn the idea. Try it yourself.
Read the explanation or try 6 questions with hints. Free, untimed and no sign-in needed.
Original learning material: a number-theory lesson for students exploring Canada’s mathematical competitions. The exercises develop consecutive sums through parity, factor pairs and complete written arguments. They are not official contest questions, a full mock paper, or a claim of exact contest difficulty.
Your goal: turn a consecutive-sum problem into a reversible factor-pair problem, check every domain condition, and prove why odd divisors count the representations.
Before you start: positive integers, odd/even numbers, factor pairs, simple equations and basic prime factorisation. Review sequences and sums, factorisation and integer solutions or counting divisors if needed. This lesson combines those ideas in one specific application.
Suggested study time: about 75–100 minutes over three sittings, with extra time for the proof extensions. This is a flexible learning estimate; pause and revisit a prerequisite when needed.
Work in three passes: starting checks and Examples 1–2; the odd-divisor proof and Examples 3–4; then the graded problems and a written extension. At each step, distinguish finding a candidate from proving that it is valid and that the list is complete.
Three starting checks
CI-D1. How many terms are in 6 + 7 + … + 13?
Answer and repair route
The terms are 6, 7, 8, 9, 10, 11, 12 and 13: eight terms. Subtracting 13 − 6 counts the seven gaps. Including both endpoints gives 13 − 6 + 1 = 8 terms.
If needed: List the terms and mark the gaps. The number of terms is one more than the number of gaps.
CI-D2. For which pair (k, b) does give an integer: (6, 15) or (6, 14)?
Answer and repair route
The first pair gives = = 5. The second gives = , which is not an integer. Opposite parity makes b − k odd; adding 1 makes it even.
If needed: Recall that even minus even and odd minus odd are even, while the difference of opposite-parity integers is odd.
CI-D3. List the positive odd divisors of 72. Include 1.
Answer and repair route
Since 72 = × , an odd divisor cannot contain a factor 2. It can contain zero, one or two factors of 3, giving 1, 3 and 9. These are all the choices.
If needed: First divide out every factor 2. Then list the positive divisors of the remaining odd number; exponent zero contributes the divisor 1.
Define the object before counting it
In this lesson a representation of a positive integer N means an increasing list of consecutive positive integers whose sum is N. Write its first term as a and its number of terms as k. Unless a question explicitly changes the rules, and , and both are integers. “At least two” means two or more terms.
The list is a, , …, a + . It has k terms and gaps. Two representations are different when their first terms or lengths differ. Reordering the same summands does not create a new representation; every list is recorded in increasing order. Zero and negative terms are excluded until the final proof extension.
It will be useful to allow k = 1 temporarily when proving the counting theorem. That creates the single list consisting of N alone. We will remove this one case explicitly when returning to the usual minimum of two terms.
Turn a list into two factors
Write the same sum forwards and backwards. Each column then has the same total, , and there are k columns. Therefore . This is the arithmetic-sum formula, derived here for consecutive terms rather than assumed as a new trick.
| position | first | second | third | fourth | fifth |
|---|---|---|---|---|---|
| forward | |||||
| backward | |||||
| column sum |
Call the second factor b = . Then and . Instead of guessing the first term, we can now inspect factor pairs of 2N. But not every orientation of every factor pair gives positive integers.
Worked example 1: Find the missing first term
Five consecutive positive integers have sum 85. Find them.
Planning hint 1 for CI-E1
Name the first term and write all five terms.
Planning hint 2 for CI-E1
The middle term of five consecutive integers is their average.
Let the first term be a. There are five terms, so the last is . Pairing the ends gives 2 × 85 = 5(). Divide by 5 to obtain 34 = , hence a = 15.
The terms are 15, 16, 17, 18 and 19. Their sum is 85, and the first term is positive. Another way to see the same calculation is that the middle term is the average = 17; the first term is two below it.
Your turn 1
Six consecutive positive integers have sum 93. Find the first and last terms.
Hint 1 for CI-T1
An even number of terms has two middle terms, so do not assume the average is an integer.
Hint 2 for CI-T1
Use 2 × 93 = 6(2a + 5).
Full solution for CI-T1
If the first term is a, the last is a + 5. The sum formula gives 186 = 6(2a + 5), so 31 = 2a + 5 and a = 13. The last term is 18. Check: six terms with average = 15.5 have sum 93. An even number of consecutive integers has a half-integer average; no individual term needs to equal that average.
The complete factor-pair test
Suppose . Since , the difference b − k is positive and odd. Thus and b and k have opposite parity: one is odd and the other even. These conditions address two different issues: parity makes the first term an integer, and the strict inequality makes it positive.
Conversely, take positive integers with uv = 2N and opposite parity. Set k = u and . Their difference is odd, so a is an integer. Since , we have . Moreover = v, so the sum of these k consecutive terms is . This proves that the conditions are sufficient as well as necessary.
We have therefore proved a reversible rule: each unordered factor pair of 2N with opposite parity gives exactly one positive representation, by taking the smaller factor as the length. It is unique because k and b determine a. The pair 1 and 2N gives the one-term sum and must be removed when is required.
A bound for a fixed length: any k positive consecutive terms are at least 1, 2, …, k term by term. Hence N ≥ . This quick check rules out lengths that are too long before any factor calculation.
Worked example 2: A factor is not yet a valid length
For the total 30, decide which of the lengths 4, 6 and 12 can give consecutive positive integers. Explain each rejection.
Planning hint 1 for CI-E2
A proposed length must divide 60, but that alone is insufficient.
Planning hint 2 for CI-E2
Check a = for both integrality and positivity.
Here 2N = 60. For each proposed length k, compute , then . The first term must be an integer and at least 1.
| first term a | Decision | ||
|---|---|---|---|
| 4 | 15 | 6 | Valid: 6 + 7 + 8 + 9 = 30 |
| 6 | 10 | Reject: not an integer | |
| 12 | 5 | −3 | Reject: not positive |
The factor pair 12 and 5 is useful, but its order is wrong for positive terms. Put the smaller factor first: k = 5, b = 12 gives a = 4 and the valid sum 4 + 5 + 6 + 7 + 8 = 30. Switching the two factors changes the representation; it does not reverse the order of the same terms.
Your turn 2
Can 42 be a sum of exactly 4 consecutive positive integers? What about exactly 12 terms?
Hint 1 for CI-T2
Use 2N = 84 and test each length separately.
Hint 2 for CI-T2
For a positive start, the companion factor b must be greater than the length k.
Full solution for CI-T2
For k = 4, b = = 21 and a = = 9. Thus 9 + 10 + 11 + 12 = 42. For k = 12, b = 7 and a = = −2, so the first term is not positive. The opposite parity test passes in both cases; the positivity test rejects the second.
Why the number of odd divisors counts the sums
The factor-pair test is complete, but it still seems to require listing factors of 2N. Parity lets us label each permitted pair by its odd member. Let d be any positive odd divisor of N, and put e = . Because is an integer, e is positive and even. Thus d and e form an opposite-parity factor pair.
Choose the smaller of d and e as the length k, and the larger as b. The factor-pair test constructs a positive representation. A large odd divisor may give an even length; the odd divisor is the label of the pair, not necessarily the length.
Conversely, take any positive representation, temporarily allowing one term. Its factors k and b have opposite parity, so exactly one is odd; call it d, and call the even one e. Since , the odd factor d divides N. Recovering the pair from that d returns exactly the original representation.
This correspondence has no omissions or repeats. Every positive representation gives one odd divisor, and an odd divisor gives only one pair and one positive representation. Therefore:
The number of representations of N by one or more consecutive positive integers equals the number of positive odd divisors of N.
The divisor d = 1 gives the pair 1 and 2N, hence the singleton N. No other divisor gives a length of 1. Consequently, the number of representations with at least two terms is the number of positive odd divisors minus 1.
For N = 1, the only odd divisor is 1, so the answer is zero. More generally, write N = with u odd and t a nonnegative integer. Its odd divisors are exactly the divisors of u. If u = 1, there is no qualifying sum. If u > 1, both 1 and u divide it, so there is at least one. Thus the positive integers with no qualifying representation are precisely the powers of 2, including 1 = .
Worked example 3: Count everything, including a surprising even length
Find every representation of 84 as a sum of at least two consecutive positive integers.
Planning hint 1 for CI-E3
List the odd divisors of 84 rather than trying every starting number.
Planning hint 2 for CI-E3
Pair each d with 168/d, put the smaller factor first, then recover a.
The positive odd divisors of 84 are 1, 3, 7 and 21. For each divisor d, pair it with e = 168/d. Choose the smaller member as the length k. The theorem above proves that this finds every positive representation exactly once.
| odd d | even e | length k | first a | sum |
|---|---|---|---|---|
| 1 | 168 | 1 | 84 | 84 alone: exclude |
| 3 | 56 | 3 | 27 | 27 + 28 + 29 |
| 7 | 24 | 7 | 9 | 9 + 10 + … + 15 |
| 21 | 8 | 8 | 7 | 7 + 8 + … + 14 |
There are three qualifying representations. The divisor 21 produces eight terms, because 8 is the smaller factor. Treating 21 as the length would give a negative start and would hide this valid eight-term sum. The one-term row is the only row excluded by the minimum of two terms.
Your turn 3
How many representations of 90 use at least two consecutive positive integers? Which representation corresponds to the odd divisor 45?
Hint 1 for CI-T3
Count the divisors of the odd part 45, then remove the one-term case.
Hint 2 for CI-T3
The companion of the odd divisor 45 is .
Full solution for CI-T3
Since 90 = 2 × × 5, its odd divisors are 1, 3, 5, 9, 15 and 45. There are six, so the theorem gives 6 − 1 = 5 qualifying representations. For d = 45, the even companion is = 4. Thus k = 4 and a = = 21, giving 21 + 22 + 23 + 24 = 90.
Count the odd part through its exponents
If the odd part is , an odd divisor chooses an exponent of 3 from 0 through r and an exponent of 5 from 0 through s. Unique prime factorisation means that different choices give different divisors and every divisor arises this way. There are choices; subtract 1 for the singleton.
The same reasoning works with any distinct odd primes. For example, if N = , where p and q are distinct odd primes and t, r, s are nonnegative integers, the number of qualifying sums is − 1. Exponent zero is a genuine choice, and a factor 2 contributes no choice to an odd divisor.
Use the theorem to count. To find the actual sums, return to the factor pairs. To impose another condition, such as an even length or a first term at least 2, filter those pairs or representations afterwards.
Worked example 4: Read a representation count backwards
Let t be a nonnegative integer and r a positive integer. If N = × × 5 has exactly seven representations using at least two consecutive positive integers, find r.
Planning hint 1 for CI-E4
The factor contributes no choices to an odd divisor.
Planning hint 2 for CI-E4
Include the exponent-zero choices, then subtract the one-term representation.
Every odd divisor has the form , where i can be any integer from 0 to r and j is 0 or 1. There are r + 1 choices for i and two choices for j, so there are odd divisors.
The count of qualifying sums is one smaller: . Thus = 8, r + 1 = 4 and r = 3. Conversely, r = 3 gives eight odd divisors and therefore seven representations for every permitted t. Multiplying by powers of 2 changes the total and may change the lengths, but not this count.
Your turn 4
Let s be a nonnegative integer and r a positive integer. If N = × × has exactly eleven representations using at least two consecutive positive integers, find r.
Hint 1 for CI-T4
Count the positive divisors of × .
Hint 2 for CI-T4
Use three choices for the exponent of 3, including exponent zero.
Full solution for CI-T4
An odd divisor has three choices for the exponent of 3 and r + 1 choices for the exponent of 7. Hence the number of sums is . Setting this equal to 11 gives = 12, so r = 3. With this value there are twelve odd divisors, giving eleven qualifying sums; the value of s does not affect the count.
Check the condition that failed
- Counting gaps as terms: a through a + has k terms, not .
- Checking divisibility only: k dividing 2N does not guarantee that the reconstructed first term is an integer. The factors must have opposite parity.
- Checking parity only: for positive terms the length must be the smaller factor. The boundary is excluded.
- Treating every odd divisor as an odd length: the length is the smaller member of the odd-even factor pair. Example 3 shows how an odd divisor produces an even length.
- Forgetting the singleton: the odd-divisor count includes N alone. Subtract exactly one when at least two terms are required.
- Counting permutations: rearranging a list does not produce a new representation. Increasing order is part of our convention.
- Changing the domain silently: a first term at least 2, or a negative start allowed, creates a different counting problem. State the change before applying a formula.
Practise with feedback
Try six questions. Choose a starting level; the next question adjusts to your answers. Hints and worked feedback are available. Saving progress is optional and stays in this browser.
Interactive practice loads here. You can also use the complete question set below.
Nine graded practice questions
Foundation checks the sum formula and the two restrictions. Core combines or changes those conditions. Stretch requires a classification, a bound or an exhaustive count. These are levels within this lesson, not official contest labels. Question 1 is an elementary warmup. The static questions below exactly match the marked practice bank.
Try each problem on paper before opening a hint. An option checks the final answer; write a reason for the parity, positivity and completeness steps yourself.
CI-Q1. Elementary warmup: count before averaging
Foundation
Seven consecutive positive integers have sum 119. What is the first term?
- 13
- 14
- 17
- 20
Hint 1 for CI-Q1
With seven terms, there is one middle term.
Hint 2 for CI-Q1
The middle term is ; the first term is three below it.
Answer and full reasoning for CI-Q1
14. The average is = 17. For seven consecutive integers, the fourth term equals the average. The first is 17 − 3 = 14, giving 14 through 20. Their sum is 7 × = 119.
Check your reasoning: The average gives the middle term, not the first. There are six gaps between seven terms.
CI-Q2. Catch the zero boundary
Foundation
A student uses 2 × 66 = 12 × 11 and chooses k = 12 as the length. Why does this fail to give a representation by consecutive positive integers?
- The first term is 0.
- The first term is not an integer.
- The sum would be 132.
- Twelve does not divide 132.
Hint 1 for CI-Q2
Recover the first term rather than checking parity alone.
Hint 2 for CI-Q2
Use with k = 12 and b = 11.
Answer and full reasoning for CI-Q2
The first term is 0.. The first term would be a = = 0. The sum 0 + 1 + … + 11 really is 66, but zero is not positive. Choosing k = 11 and b = 12 instead gives a = 1 and the valid sum 1 + 2 + … + 11 = 66.
Check your reasoning: Opposite parity guarantees an integer start. It does not guarantee a positive start unless the smaller factor is the length.
CI-Q3. Choose a total for a fixed length
Foundation
Which number can be written as the sum of exactly six consecutive positive integers?
- 44
- 46
- 45
- 48
Hint 1 for CI-Q3
Write the six terms starting at a positive integer a.
Hint 2 for CI-Q3
Their sum is 65, so subtract 15 from each proposed total.
Answer and full reasoning for CI-Q3
45. Six consecutive terms sum to 65. For the totals 44, 46, 45 and 48, subtracting 15 gives 29, 31, 30 and 33 respectively. Only 30 is divisible by 6, giving a = 5. Thus 45 = 5 + 6 + 7 + 8 + 9 + 10.
Check your reasoning: An even length can have a half-integer average. Divisibility of the total by six is not the correct requirement.
CI-Q4. A stricter lower bound
Core
How many representations of 120 use at least two consecutive integers, with every term at least 2?
- 1
- 3
- 4
- 2
Hint 1 for CI-Q4
First count representations with positive terms, then remove any starting at 1.
Hint 2 for CI-Q4
The odd part of 120 is 15, and 1 + 2 + … + 15 = 120.
Answer and full reasoning for CI-Q4
2. The odd divisors of 120 are 1, 3, 5 and 15, so there are three representations with positive terms and at least two terms. Their factor pairs give 39 + 40 + 41, 22 + 23 + 24 + 25 + 26, and 1 + 2 + … + 15. Only the last begins at 1; the other two have every term at least 2. Therefore the answer is 2.
Check your reasoning: The odd-divisor theorem assumes the first term is at least 1. A stricter lower bound needs another check.
CI-Q5. Scale the total, not the terms
Core
A positive integer M has exactly five representations as a sum of at least two consecutive positive integers. How many such representations does 4M have?
- 4
- 5
- 10
- 20
Hint 1 for CI-Q5
What happens to the positive odd divisors when you multiply by 4?
Hint 2 for CI-Q5
M and 4M have the same odd part, hence the same positive odd divisors.
Answer and full reasoning for CI-Q5
5. The theorem says M has six positive odd divisors because one is subtracted to give five representations. Multiplication by 4 adds only factors of 2, so 4M has exactly the same six odd divisors. Therefore 4M also has 6 − 1 = 5 representations. This does not mean that multiplying every term of a sum by 4 preserves consecutiveness.
Check your reasoning: The count is unchanged because of the divisor correspondence. Scaling the terms makes their common difference 4, not 1.
CI-Q6. Make the sum as long as possible
Core
What is the greatest possible number of terms in a representation of 150 as a sum of consecutive positive integers?
- 12
- 16
- 15
- 17
Hint 1 for CI-Q6
A k-term positive sum is at least 1 + 2 + … + k.
Hint 2 for CI-Q6
Seventeen terms already total at least 153. Test the remaining candidate lengths 16 and 15 using 2N = 300.
Answer and full reasoning for CI-Q6
15. Since 1 + 2 + … + 17 = 153 > 150, a qualifying length is at most 16. Length 16 is impossible because it does not divide 300. For length 15, the companion factor is = 20 and the first term is = 3. The sum 3 + 4 + … + 17 has fifteen terms and total 150. Thus 15 is both attainable and the largest possible length.
Check your reasoning: Showing that a length works is not enough to prove it is greatest; rule out every longer permitted length.
CI-Q7. The smallest total with five representations
Stretch
What is the least positive integer having exactly five representations as a sum of at least two consecutive positive integers?
- 27
- 75
- 105
- 45
Hint 1 for CI-Q7
Its odd part must have exactly six positive divisors.
Hint 2 for CI-Q7
An odd number with six divisors is or for distinct odd primes p and q. Minimise each form.
Answer and full reasoning for CI-Q7
45. Write N = with u odd and t nonnegative. The theorem requires u to have six divisors. Each prime that actually divides u has a positive exponent, so each exponent-plus-one factor is at least 2. Three such factors would give at least divisors, so at most two primes occur. The divisor-count product can therefore be 6 only as 6 or 3 × 2, so unique prime factorisation gives u = or u = for distinct odd primes. The first form is at least = 243. For the second form, if p = 3 then q is at least 5, giving at least 45; if p is at least 5 then q is at least 3, giving at least 75. Thus u is at least 45, and N is at least u. Taking N = 45 = × 5 attains six odd divisors and hence five representations.
Check your reasoning: A candidate such as 75 has the required count but is not least. Classify all allowed prime-exponent patterns before minimising.
CI-Q8. Count only even lengths
Stretch
How many representations of 315 as a sum of consecutive positive integers have an even number of terms?
- 4
- 5
- 6
- 11
Hint 1 for CI-Q8
Use 2N = 630. If k is even, its companion factor must be odd.
Hint 2 for CI-Q8
Since 630 = 2 × 315, write with d an odd divisor of 315. Also use the length bound .
Answer and full reasoning for CI-Q8
5. An even length k must divide 630 with an odd companion. Because 630 has only one factor 2, this means where d divides 315. Also 1 + 2 + … + 25 = 325 > 315, so and . The positive divisors of 315 not exceeding 12 are exactly 1, 3, 5, 7 and 9. They give lengths 2, 6, 10, 14 and 18. Their companion factors are 315, 105, 63, 45 and 35, respectively; each is odd and larger than its length, so all five work. Their first terms are 157, 50, 27, 16 and 9.
Check your reasoning: The total representation count includes both parities. Filter the valid factor pairs by the parity of the length, not by the odd divisor alone.
CI-Q9. Count the totals with a unique representation
Stretch
How many integers N with have exactly one representation as a sum of at least two consecutive positive integers?
- 19
- 21
- 25
- 23
Hint 1 for CI-Q9
The odd part of N must have exactly two positive divisors.
Hint 2 for CI-Q9
That odd part must be an odd prime p. List the numbers up to 40, grouping them by p.
Answer and full reasoning for CI-Q9
23. Exactly one representation means exactly two odd divisors, so the odd part must be an odd prime. Grouping by that prime gives: p = 3 contributes 3, 6, 12, 24; p = 5 contributes 5, 10, 20, 40; p = 7 contributes 7, 14, 28; p = 11 contributes 11, 22; p = 13 contributes 13, 26; p = 17 contributes 17, 34; p = 19 contributes 19, 38; and p = 23, 29, 31, 37 contributes one number each. These are all odd primes at most 40, and the groups cannot overlap because the odd part is unique. The total is 4 + 4 + 3 + 2 + 2 + 2 + 2 + 1 + 1 + 1 + 1 = 23.
Check your reasoning: Do not include powers of 2: their odd part is 1 and they have no qualifying representation. Do not count a number in more than one prime group.
Three written-proof extensions
Write connected arguments after an unaided attempt. The checklists are for reviewing your own proof and are not official marking schemes. Extension 3 deliberately changes the domain; keep it separate from the positive-term counting rule.
CI-C1. Which totals admit a fixed length?
Fix an integer . Prove that the totals representable by exactly k consecutive positive integers are precisely N = + kt, where t is a nonnegative integer. Deduce a divisibility-and-size description for odd k and for even k.
Hint 1 for CI-C1
Start with the smallest possible list 1, 2, …, k. What happens when every term increases by t?
Hint 2 for CI-C1
For the converse, write an arbitrary positive first term as a = 1 + t. Then separate the parity cases in N = .
Full proof for CI-C1
The smallest list is 1, 2, …, k, with total . Increasing every term by a nonnegative integer t adds kt to the total and keeps all terms positive and consecutive. Thus every displayed N has a representation, starting at 1 + t.
Conversely, any qualifying list starts at a positive integer a. Put t = a − 1, so t is a nonnegative integer. Each term of a, , …, a + is t above the corresponding term of 1, 2, …, k. Therefore its total is + kt. This proves both directions.
If k is odd, is an integer, so the permitted totals are exactly the multiples of k that are at least . Indeed any such multiple differs from by a nonnegative multiple of k.
If k is even, write . Then N = h(2h − 1), an odd multiple of h = k/2. The size condition is still N ≥ . Conversely, if for an odd integer q and meets this size bound, then . The value a = is an integer at least 1, giving the required sum. Both parity and size are necessary.
Self-review checklist
- Prove that every proposed total can be constructed by shifting 1 through k.
- Prove that every positive representation arises from a nonnegative shift.
- For odd k, explain both the divisibility and the lower bound.
- For even k, require an odd multiple of k/2 and verify the reconstructed first term.
CI-C2. Exactly one way
Prove that a positive integer N has exactly one representation as a sum of at least two consecutive positive integers if and only if N = , where t is a nonnegative integer and p is an odd prime. Give the length and first term of that unique representation in terms of t and p.
Hint 1 for CI-C2
Use the proved counting theorem and examine the odd part of N.
Hint 2 for CI-C2
The only nontrivial odd divisor is p. Pair it with and choose the smaller factor as the length.
Full proof for CI-C2
Write N = where t is a nonnegative integer and u is odd. This is obtained by dividing N by 2 until its odd part u remains. The positive odd divisors of N are precisely the positive divisors of u.
By the theorem, exactly one qualifying representation means u has exactly two positive divisors. A positive integer has exactly two positive divisors precisely when it is prime: a composite number has a divisor strictly between 1 and itself, whereas a prime has only 1 and itself. Here u is odd, so u = p for an odd prime p. Conversely, N = has odd divisors 1 and p only, hence exactly one qualifying representation.
The divisor p corresponds to the factor pair p and of 2N. One factor is odd and the other is even, so they are distinct. Let be the smaller and the larger. The unique length is k = and the first term is a = . Both factors exceed 1: p ≥ 3 and ≥ 2. Hence , and opposite parity and > make a a positive integer. This explicitly constructs the unique sum.
Self-review checklist
- Use the theorem with its one-term subtraction.
- Explain why the odd part has two divisors exactly when it is an odd prime.
- Prove both directions of the classification.
- Construct the sum from p and and check the length and positivity conditions.
CI-C3. What changes when zero and negative starts are allowed?
In this extension only, the first term may be any integer, including zero or a negative integer. Let N be positive, and let d be its number of positive odd divisors. Prove that N has exactly representations as a sum of at least two consecutive integers. Representations are still written in increasing order.
Hint 1 for CI-C3
The factor equation still holds. Why must the second factor still be positive?
Hint 2 for CI-C3
For each opposite-parity factor pair, try both factors as the length. Compare the two resulting first terms.
Full proof for CI-C3
Let and let a be any integer. Set b = . Since and with , we must have . Also b and k have opposite parity. Conversely, every ordered pair of positive factors (k, b) of 2N with opposite parity gives the integer and a sum equal to N. Positivity of a is no longer required.
As in the main theorem, the unordered opposite-parity factor pairs correspond exactly to the d positive odd divisors of N. Their two members are distinct, so each pair gives two ordered choices for (k, b), hence two different lengths and two distinct representations. Thus there are 2d representations if a one-term sum is allowed.
Exactly one has k = 1: the singleton N. Removing it leaves representations with at least two terms. No other one-term representation is possible because a single term must equal N.
To see where the extra sums come from, write a factor pair as . The positive-start choice k = u has first term . The other choice k = v has first term = , which is at most zero. A zero start occurs precisely when a = 1. These sums were deliberately excluded from the main lesson, and are counted only under this changed rule.
Self-review checklist
- Explicitly change the domain of the first term while retaining and positive length.
- Show that both factors remain positive and have opposite parity.
- Explain why two orientations give two distinct representations per odd divisor.
- Remove exactly one singleton and account for zero or negative starts.
Explain the correspondence without looking
Explain why the odd divisor 21 of 84 gives eight positive terms rather than twenty-one. Then state exactly which representation is removed by the “at least two terms” rule. If either step needed a hint, rebuild the factor-pair table later before moving to a fresh total.
Continue through the number-theory learning path, or consult the Canada guide for the selection route and official preparation resources.
Canada preparation context and official practice
The Canadian Mathematical Society’s COMC preparation page lists sequences and series, together with elementary number theory topics including divisibility, number of divisors and simple Diophantine equations. This lesson connects those ingredients through one application: consecutive positive-integer sums. Its Foundation, Core and Stretch labels describe the learning sequence within this lesson, not an official paper classification.
Consult the 2026 COMC teacher FAQ for the official response requirements, and use the released 2025 COMC paper for official paper practice. The topic overlap supports this lesson as preparation; it does not establish that this particular theorem appeared on that paper or predict the next paper’s difficulty. The questions and explanations here were authored independently and are not copied, translated or numerically adapted from the released paper.
Official source context checked 7 October 2026.