Question

In: Advanced Math

1.a.)Use the assumed Babylonian square root algorithm (also known as Archimedes’ method) √ a 2 ±...

1.a.)Use the assumed Babylonian square root algorithm (also known as Archimedes’ method) √ a 2 ± b ≈ a ± b/2a to show that √ 3 ≈ 1; 45 by beginning with the value a = 2. Find a three-sexagesimal-place approximation to the reciprocal of 1; 45 and use it to calculate a three-sexagesimal-place approximation to √ 3.

1.b)An iterative procedure for closer approximations to the square root of a number that is not a square was obtained by Heron of Alexandria (ca. 75 CE). In his work Metrica he merely states a rule that amounts to the following in modern notation: If A is a non square number, and a^2 is the nearest perfect square to it, so that A = a^2 ± b, then approximations to √ A can be obtained using the recursive formula:

x0 = a

xn = 1/2 ( Xn−1 + A/( Xn−1)), n ≥ 1

(i) Use Heron’s method to find approximations through n = 3 to √ 720 and √ 63.

(ii) Show that Heron’s approximation x1 is equivalent to the Babylonian’s square root algorithm.

Solutions

Expert Solution

SOLUTION:

Given That data Use the assumed Babylonian square root algorithm of the text to show that v3 1:45 by beginning with the value 2. Find a three-sexagesimal-place approximation to the reciprocal of 1:45 and use it to calculate a three-sexagesimal-place approximation to V3

So the answer is given below


Related Solutions

Babylonian Algorithm. The Babylonian algorithm to compute the square root of a positive number n is as follows:
Chapter 3 Exercise 1Babylonian Algorithm. The Babylonian algorithm to compute the square root of a positive number n is as follows:      1. Make a guess at the answer (you can pick n/2 as your initial guess).      2. Computer = n / guess.      3. Set guess = (guess +r) / 2.      4. Go back to step 2 until the last two guess values are within 1% of each other.Write a program that inputs an integer for n, iterates through the Babylonian algorithm until the guess...
. (This is a version of Programming Project 2.1 from Chapter 2.) The Babylonian algorithm to...
. (This is a version of Programming Project 2.1 from Chapter 2.) The Babylonian algorithm to compute the square root of a positive number n is as follows: 1. Make a guess at the answer (you can pick n/2 as your initial guess). 2. Compute r = n / guess. 3. Set guess = (guess +r) / 2. 4. Go back to step 2 until the last two guess values are within 1% of each other. Write a JAVA program...
Use the Newton’s method to find the root for ex+1 = 2 + x, over [−2,...
Use the Newton’s method to find the root for ex+1 = 2 + x, over [−2, 2]. Can you find a way to numerically determine whether the convergence is roughly quadratic using error produced at each iteration? Include your answers as Matlab code comments
The “divide and average” method, an old time method for approximating the square root of any...
The “divide and average” method, an old time method for approximating the square root of any positive number a, can be formulated as x = (x + a/x) / 2 Write a well-structured M-file function based on the while…break loop structure to implement this algorithm. At each step estimate the error in your approximation as ε = abs(( Xnew − Xold )/Xnew Repeat the loop until e is less than or equal to a specified value. Design your program so...
Describe briefly the following method of Out of Sample forecast criterion 1... Root Mean Square error...
Describe briefly the following method of Out of Sample forecast criterion 1... Root Mean Square error 2...Mean absolute error 3...Mean absolute percentage error 4...Maximum Absolute Error 5...Maximum Absolute Percentage error. Write down their formulae and discuss briefly how you interpret them
How could a root finding algorithm like the bisection method be used to approximate a value...
How could a root finding algorithm like the bisection method be used to approximate a value such as sqrt(3). In other words how can a root finding algorithm find an x value with a given y value? Write a script to illustrate this usage scenario. Compare the output of your script with the result from a calculator. You must use matlab!! using a while loop.
4. Use a proof by contradiction to show that the square root of 3 is irrational....
4. Use a proof by contradiction to show that the square root of 3 is irrational. You may use the following fact: For any integer k, if k2 is a multiple of 3, then k is a multiple of 3. Hint: The proof is very similar to the proof that √2 is irrational. 5. Use a direct proof to show that the product of a rational number and an integer must be a rational number. 6. Use a proof by...
show the root sum square method for describing the total uncertainty of a quantity, which depends...
show the root sum square method for describing the total uncertainty of a quantity, which depends on a set of parameters called Xi (i=1,n) explain the roll of the sensitivity coefficient of each parameters. This is experimental fluid dynamics question, please explain nicely
Use the secant Method to find a root for the function: f(x) = x^3 + 2x^2...
Use the secant Method to find a root for the function: f(x) = x^3 + 2x^2 + 10x -20, with x_0 = 2, and x_1 = 1.
A positive number is added to the reciprocal of its square root. Use Calculus methods to...
A positive number is added to the reciprocal of its square root. Use Calculus methods to answer the following questions:what if anything, is the smallest such sum? What, if any, positive x-values will yield the smallest sum? Give exact answers as well as answers accurate to Five decimal place. Be sure to give a mathematical justification that you answer represents a minimum and not a maximum.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT