recursively defined by Create a program for a scientific calculator for finding the terms of the...

 

Transcribed Image Text:

recursively defined by Create a program for a scientific calculator for finding the terms of the sequence (pn) Pn-1-Pn-2 Pn=Pn-1-f(Pn-1). f(Pn-1)-f(pn-2) for all n 2, where and where the function f is given by Po 1 and p₁ = 0.235 f(x)=x sin(0.40x) - 0.20. (ii) Execute the program to generate the terms p2, P3,...,ps of the sequence (pn); please make sure that your calculator is in RADIAN mode before commencing calculations. All terms pk must be rounded to eight decimal places after the period and presented in a table of the form n Pn 0 Po 1 2 P1 P2 where Pk denotes the result of rounding of the term pk to eight decimal places. (iii) It can be shown that the sequence (pn) converges to the unique root y of the function f in [0, 1]. So evaluate f(p8) to see whether the number ps approximates y well enough. recursively defined by Create a program for a scientific calculator for finding the terms of the sequence (pn) Pn-1-Pn-2 Pn=Pn-1-f(Pn-1). f(Pn-1)-f(pn-2) for all n 2, where and where the function f is given by Po 1 and p₁ = 0.235 f(x)=x sin(0.40x) - 0.20. (ii) Execute the program to generate the terms p2, P3,...,ps of the sequence (pn); please make sure that your calculator is in RADIAN mode before commencing calculations. All terms pk must be rounded to eight decimal places after the period and presented in a table of the form n Pn 0 Po 1 2 P1 P2 where Pk denotes the result of rounding of the term pk to eight decimal places. (iii) It can be shown that the sequence (pn) converges to the unique root y of the function f in [0, 1]. So evaluate f(p8) to see whether the number ps approximates y well enough.

Answer rating: 100% (QA)

import math def fx return mathsin040 x 020 def calculatesequences p 1 0235 Ini... View the full answer