Proof WritingHardInduction ShareInduction · Hard problemWith F1=F2=1F_1 = F_2 = 1F1=F2=1 and Fn+1=Fn+Fn−1F_{n+1} = F_n + F_{n-1}Fn+1=Fn+Fn−1, strong induction proves Fn≥(32)n−2F_n \ge \left(\tfrac32\right)^{n-2}Fn≥(23)n−2. What is the smallest nnn with Fn>1000F_n > 1000Fn>1000?Check Show answer Walk through it step by step Practice more like this Review this concept