Answer:
The area is 52.6 square inches.
Step-by-step explanation:
If you don't know base or height but you have info on a triangle, such as two sides and the angle in between, and a little bit of trig, you can find the area.
There's an SAS Trig Triangle area formula:
A = 1/2×side×side×sin
this works for two sides and the angle in between, which is exactly the info you have in your question.
A = 1/2(14)(8)sin70°
A = 56sin70°
A = 52.6 sq inches
. devise a recursive algorithm for computing n2 where n is a nonnegative integer, using the fact that (n 1)2 = n2 2n 1. then prove that this algorithm is correct
Recursive algorithm for computing n²: 1. If n equals 0, return 0 (base case), 2. Otherwise, recursively compute (n-1)², 3. Compute n² by using the formula: n² = (n-1)² + 2n - 1.
What is recursive algorithm?
A recursive algorithm is a problem-solving approach where a function calls itself to solve smaller instances of the same problem until a base case is reached.
To prove the correctness of the recursive algorithm for computing n², we will use mathematical induction.
Base case: For n = 0, the algorithm returns 0, which is correct since 0² equals 0.
Inductive step: Assume that the algorithm correctly computes n² for a given nonnegative integer k, i.e., n² = k². Now, we will show that it also computes (k+1)² correctly.
According to the algorithm, (k+1)² is computed by first calculating k² using the recursive step, and then applying the formula n² = (n-1)² + 2n - 1.
Using the assumption, we have k² = (k-1)² + 2k - 1.
Expanding (k-1)², we get k² - 2k + 1 + 2k - 1 = k².
Therefore, (k+1)² = k² + 2(k+1) - 1, which simplifies to (k+1)² = k² + 2k + 1.
This matches the definition of (k+1)², so the algorithm correctly computes (k+1)².
By induction, we have proven that the algorithm correctly computes n² for any nonnegative integer n.
learn more about recursive algorithm here:
https://brainly.com/question/12115774
#SPJ4