← Senior Mathematics Studio

LEARN · EXPLAIN · REVISE

Prove the shifted-integer sum by induction.

Read the idea, work independently, then explain what changed.

Return to the lesson / paper ↗

高二選擇性必修 第二册(A版).pdf · 4.4 · PDF 49 / printed page 44

Revisit first: Arithmetic sequencesGeometric sequences

TOPIC 01

Mathematical induction

Build proofs with a verified base, an explicit induction hypothesis and a valid step.

What you will be able to explain

  • Build proofs with a verified base, an explicit induction hypothesis and a valid step.
  • Justify the method and check the conditions in a new situation.

Try it. Leave your reasoning visible.

Use one hint at a time. A correction explains what changed, not just the final answer.

01 / Foundation#Your turn

Prove the shifted-integer sum by induction.

∑j=1n(j+5)=n(5)+n(n+1)/2\sum_{j=1}^n(j+5)=n(5)+n(n+1)/2
  • Induction proves a statement only for the specified integer domain starting at the base case.
Skills and prerequisite lessons

Working and explanation

BUILD THE REASONING

Hint 1
Verify the base case, assume the claim at k, and prove it at k+1.
Hint 2
Use this intermediate relation.
S(k+1)=S(k)+k+1+tS(k+1)=S(k)+k+1+t
Worked solution
  1. Verify the base case, assume the claim at k, and prove it at k+1.

  2. Apply the stated relation and retain its conditions.

    n=1:1+5=5+1n=1:1+5=5+1
  3. Apply the stated relation and retain its conditions.

    Sk+1=5k+k(k+1)/2+k+1+5S_{k+1}=5k+k(k+1)/2+k+1+5
  4. Apply the stated relation and retain its conditions.

    Sk+1=5(k+1)+(k+1)(k+2)/2S_{k+1}=5(k+1)+(k+1)(k+2)/2
  5. The next shifted term includes the fixed constant.

The requested relation or conclusion is shown below.

Sn=5n+n(n+1)/2S_n=5n+n(n+1)/2

Checks and common pitfalls: The next shifted term includes the fixed constant.

Reasoning checklist · self / teacher assessment
  • State a valid definition or model and its assumptions.
  • Show the intermediate mathematical relations, not only the final claim.
  • Check exclusions, units or the interpretation of the result.

Think first. Reveal a hint when the class is ready.

Focus on one question

Teacher preparation and assessment

Question sequence

  • Build proofs with a verified base, an explicit induction hypothesis and a valid step.
  • Which condition is essential in mathematical induction?
  • Can a correct induction step rescue a false or missing base case?

Board plan

  • Defining relation: Build proofs with a verified base, an explicit induction hypothesis and a valid step.
    P(n0)∧[P(k)⇒P(k+1)]P(n_0)\land[P(k)\Rightarrow P(k+1)]
  • Conditions: Induction proves a statement only for the specified integer domain starting at the base case.

Anticipated thinking

  • Checking many examples does not establish the induction step.

Assessment checklist

  • 1 mark: choose the correct representation and conditions.
  • 1 mark: establish the intermediate relation.
  • 1 mark: complete a connected calculation or proof.
  • 1 mark: interpret and check the conclusion.

No sign-in. Work stays in this browser. Export before clearing browser data. Written reasoning is assessed with a checklist.

Curriculum and source notes ↗