a) Prove or disprove that whenever $n \ge 3$, $f_n > a^{n-2}$, where $a = (1 + \sqrt{5}) / 2$ using strong induction principle.
Added by Denise R.
Close
Step 1
Step 1: Base case for n ≤ 3 When n = 1, f(1) = 1 > a^(1-2) = a^(-1) = 1/a = 1/(1 + √5)/2 = 2/(1 + √5) > 1 When n = 2, f(2) = 1 > a^(2-2) = a^0 = 1 When n = 3, f(3) = 2 > a^(3-2) = a^1 = (1 + √5)/2 Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 69 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Use induction (or strong induction, or proof by smallest counterexample) to prove that 1+2+3+4+...+n = n(n + 1)/2 for every positive integer n.
Adi S.
If $a b=b a$, then $(a b)^{n}=a^{n} b^{n}$ for every positive integer $n .$ Prove by induction.
ELEMENTARY PROPERTIES OF GROUPS
H
Prove using strong induction that for any positive integer n and any x ∈ R where x != 0 that if x + 1/ x is an integer then x^n + 1/x^n is also an integer.
Madhur L.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD