Help with complex (1 Viewer)

[mathsbrain]

Very stuck on b) and c)...

 

[Trebla]

Since is a root then

Which implies

Use the same argument for and the result follows

For the strong induction step use the property that

and

and the result should follow

 

[mathsbrain]

Since is a root then

Which implies

Use the same argument for and the result follows

For the strong induction step use the property that

and

and the result should follow

is this an HSC question?

 

[Drdusk]

is this an HSC question?

You're the one who asked the question. Shouldn't you know lol

 

[mathsbrain]

You're the one who asked the question. Shouldn't you know lol

If i know the answer i wouldnt have asked lol

 

[Drdusk]

If i know the answer i wouldnt have asked lol

Ah that's not what I meant.

To answer your question I don't think it's a HSC question but I do recall seeing this in a Girra trial

 

[mathsbrain]

also never quite understood difference between strong vs weak induction, any examples to help make sense of this?

 

[fan96]

also never quite understood difference between strong vs weak induction, any examples to help make sense of this?

Say you have a statement you're trying to prove by induction.

A normal induction proof would go like "if this statement is true for k then it must also be true for k + 1."

A strong induction proof would be more like "if this statement is true for all numbers less than or equal to k then it must also be true for k + 1."

This extra condition gives you more to work with, and you sometimes need it for harder proofs.

(You may not need to make the assumption for every single number less than k, but you would need to make the assumption for at least a few.)

I vaguely remember doing a question related to the Fibonacci numbers with strong induction - you can try to find it online.

 

[CM_Tutor]

I vaguely remember doing a question related to the Fibonacci numbers with strong induction - you can try to find it online.

One such question proves Binet's formula for the nth Fibonacci number as follows:

Define F₀ = 0, F₁ = 1, and F_{k + 2} = F_{k + 1} + F_k for non-negative integers k. Use strong induction to prove that



for all non-negative integers n.

Strong induction is required as you need to assume a formula for F_{k + 1} and F_k and so need to prove two consecutive values work in the first part.

An alternative proof (also requiring strong induction) is as follows:

Prove that provided x² = x + 1, then (with the above definition of F_n) for all integers n greater than 1. From this result, derive Binet's formula.