Proof by Induction & Contradiction (DP IB Analysis & Approaches (AA): HL): Exam Questions

2 hours20 questions
1
5 marks

Use proof by contradiction to prove that there is no x∈ℝ such that  −2x−2=x−3.

2
4 marks

Using the method of proof by contradiction, prove that 7 is irrational.

3
4 marks

Using mathematical induction, prove that 6n−1 is divisible by 5 for n∈ℤ, n≥1.

4
6 marks

Prove by mathematical induction 3n≥1+2n, given n≥0.

5
6 marks

Prove by mathematical induction that if y=11−x  then dnydxn=n!(1−x)n+1.

6
6 marks

Prove by induction that

Σr=1nr2=16n(n+1)(2n+1)

for all values of n, n∈ℤ+.

1
4 marks

Prove by mathematical induction that  92n−1, n∈ℤ, n≥1 is divisible by 16.

2
4 marks

Prove by contradiction that 10 is irrational.

3
6 marks

Use mathematical induction to prove that the nth derivative of the function f(x)=5x is  given by

 5(−1)nn!x(n+1) 

for all integers, n, where n≥1.

 

4
6 marks

Use proof by contradiction to prove that a2−8b−11≠0 if a, b∈ℤ.

5
6 marks

Prove by mathematical induction, that for n∈ℤ+,

1+2(12)+3(12)2+4(12)3+...+n(12)n−1=4−n+22n−1

6
6 marks

Use a contradiction to prove that the difference between a rational number and an irrational number is irrational.

7
6 marks

Prove by mathematical induction that if f(x)=xe2x then f(n)(x)=(2nx+n2n−1)e2x .

8
6 marks

Prove by mathematical induction that

(cos θ−i sin θ)n=cos(nθ)−i sin(nθ), for all n∈ℤ+

1
6 marks

Prove that 2n+2+33n is divisible by 5 for n∈ℤ, n≥0.

2
4 marks

Prove that there are an infinite number of prime numbers.

3
5 marks

Prove that the equation 5x4+15x3−20x2−4=0 has no integer solutions.

4a
3 marks

Show that the derivative of y=xe−x is

dydx=e−x(1−x).

4b
7 marks

Prove, by mathematical induction, that for n≥1,

dndxn=e−x[(−1)n−1n+(−1)nx]

5
7 marks

Prove that [r(cos θ−isinθ)]n=rn[cos(nθ)−isin(nθ)],  for all n∈ℤ+  .

6
7 marks

Prove by Induction that

∑r=1nr(r2−6)=14n(n+1)(n+4)(n−3)

for all positive integer values of n.