SmarterEd

Aussie Maths & Science Teachers: Save your time with SmarterEd

  • Login
  • Get Help
  • About

Proof, EXT1 2026 HSC 7 MC

In a false proof by induction for integers  \(n \geq 1\), \(S(n)\) is the statement:

In every list containing \(n\) numbers, all the numbers are equal to each other.

So \(S(1)\) is the statement:

In every list containing 1 number, that number is equal to itself.

\(S(2)\) is the statement:

In every list containing 2 numbers, those numbers are equal.

Which of the following is FALSE?

  1. \(S(1)\)
  2. \(\text{If}\ S(1)\ \text{then}\ S(2)\)
  3. \(\text{If}\ S(2)\ \text{then}\ S(3)\)
  4. \(\text{If}\ S(3)\ \text{then}\ S(4)\)
Show Answers Only

\(B\)

Show Worked Solution

\(S(1) \ \text{is true (a number equals itself).}\)

\(S(2) \ \text{is false (e.g. the list} \ \{1, 2\}).\)

\(\Rightarrow \ \text{“If} \ S(1) \ \text{then} \ S(2)\text{” is false (true statement implies false statement).}\)
 

\(\text{Options} \ C \ \text{and} \ D \ \text{are true.}\)

\(\text{(An “If … then …” statement is always true when the “If” part is false).}\)

\(\Rightarrow B\)

Filed Under: Induction (Y12) Tagged With: Band 4, smc-7281-50-False Proofs

Proof, EXT1 EQ-Bank 16

Consider the following proposition:

\(1+2+3+\ldots+n=\dfrac{1}{2}(n-1)(n+2)\)  for integers  \(n \geqslant 1\).

  1. Show that the proposition does not satisfy the initial case of mathematical induction proof.   (1 mark)

    --- 4 WORK AREA LINES (style=lined) ---

  2. Show that the inductive step of the false proposition can, however, be proven.   (2 marks)

    --- 10 WORK AREA LINES (style=lined) ---

Show Answers Only

a.    \(\text{Proof: See worked Solutions}\)

b.    \(\text{Proof: See worked Solutions}\)

Show Worked Solution

a.    \(\text{Initial case:} \ n=1\)

\(\text{LHS}=1\)

\(\text{RHS}=\dfrac{1}{2}(1-1)(1+2)=0 \neq \text{LHS}\)

\(\therefore \ \text{Initial case of} \ \ n=1\ \ \text {is not satisfied.}\)
 

b.    \(\text{if} \ \ n=k:\)

\(1+2+\ldots+k=\dfrac{1}{2}(k-1)(k+2)\)
 

\(\text{Prove true for} \ \ n=k+1:\)

\(\text{i.e.} \ \  1+2+\ldots+k+(k+1)=\dfrac{1}{2} k(k+3)\)

\(\operatorname{LHS}\) \(=1+2+\ldots+k+k+1\)
  \(=\dfrac{1}{2}(k-1)(k+2)+k+1\)
  \(=\dfrac{1}{2}\left(k^2+k-2\right)+\dfrac{1}{2}(2 k+2)\)
  \(=\dfrac{1}{2}\left(k^2+k-2+2 k+2\right)\)
  \(=\dfrac{1}{2}\left(k^2+3 k\right)\)
  \(=\dfrac{1}{2} k(k+3)\)
  \(=\operatorname{LHS}\)

 

\(\therefore \ \text{The inductive step can be proven.}\)

Filed Under: Induction (Y12) Tagged With: Band 3, Band 4, smc-7281-20-Sum of a Series, smc-7281-50-False Proofs

Copyright © 2014–2026 SmarterEd.com.au · Log in