he Intermediate Value Theorem can be used to approximate a root. The following is an example of binary earch in computer science. Suppose you want to approximate √5. You know that it is between 2 and 3. If you onsider the function f(x)=x²-5, then note that f(2) < 0 and f(3) > 0. Therefore by the Intermediate alue Theorem, there is a value, 2 ≤ c < 3 such that f(c) 0. Next choose the midpoint of these two alues, 2.5, which is guaranteed to be within 0.5 of the acutal root. f(2.5) will either be less than 0 or reater than 0. You can use the Intermediate Value Theorem again replacing 2.5 with the previous endpoint that has the same sign as 2.5. Continuing this process gives a sequence of approximations en with 1 = 2.5. low many iterations must you do in order to be within 0.00390625 of the root? Submit Question Jump to Answer =

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter4: Polynomial And Rational Functions
Section4.5: Zeros Of Polynomial Functions
Problem 79E
icon
Related questions
Question
Question 11
Textbook
T
Submit Question
< >
Videos [+]
The Intermediate Value Theorem can be used to approximate a root. The following is an example of binary
search in computer science. Suppose you want to approximate √5. You know that it is between 2 and 3. If you
consider the function f(x)=x²-5, then note that f(2) < 0 and f(3) > 0. Therefore by the Intermediate
Value Theorem, there is a value, 2 ≤ c < 3 such that f(c) = 0. Next choose the midpoint of these two
values, 2.5, which is guaranteed to be within 0.5 of the acutal root. f(2.5) will either be less than 0 or
greater than 0. You can use the Intermediate Value Theorem again replacing 2.5 with the previous endpoint
that has the same sign as 2.5. Continuing this process gives a sequence of approximations with 1 = 2.5.
How many iterations must you do in order to be within 0.00390625 of the root?
Jump to Answer
Transcribed Image Text:Question 11 Textbook T Submit Question < > Videos [+] The Intermediate Value Theorem can be used to approximate a root. The following is an example of binary search in computer science. Suppose you want to approximate √5. You know that it is between 2 and 3. If you consider the function f(x)=x²-5, then note that f(2) < 0 and f(3) > 0. Therefore by the Intermediate Value Theorem, there is a value, 2 ≤ c < 3 such that f(c) = 0. Next choose the midpoint of these two values, 2.5, which is guaranteed to be within 0.5 of the acutal root. f(2.5) will either be less than 0 or greater than 0. You can use the Intermediate Value Theorem again replacing 2.5 with the previous endpoint that has the same sign as 2.5. Continuing this process gives a sequence of approximations with 1 = 2.5. How many iterations must you do in order to be within 0.00390625 of the root? Jump to Answer
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897…
Glencoe Algebra 1, Student Edition, 9780079039897…
Algebra
ISBN:
9780079039897
Author:
Carter
Publisher:
McGraw Hill
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Trigonometry (MindTap Course List)
Trigonometry (MindTap Course List)
Trigonometry
ISBN:
9781337278461
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
Big Ideas Math A Bridge To Success Algebra 1: Stu…
Big Ideas Math A Bridge To Success Algebra 1: Stu…
Algebra
ISBN:
9781680331141
Author:
HOUGHTON MIFFLIN HARCOURT
Publisher:
Houghton Mifflin Harcourt