Explore BrainMass

# Recursive definitions

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

(See attached file for full problem description)

---
Give a recursive definition of
a) of the functions max and min so that mx{a1,a2,..an and min {a1,a2,...an} are the maximum and minimum of the n numbers a1,a2,...an respectively
b) prove that f12+f22+..fn2 = fnfn+1 whenever n is a positive integer fn is the Fibonacci sequence.

https://brainmass.com/math/optimization/recursive-definitions-84169

#### Solution Preview

Give a recursive definition of
a) of the functions max and min so that mx{a1,a2,..an and min {a1,a2,...an} are the maximum and minimum of the n numbers a1,a2,...an respectively

Let the numbers a1, a2, ... an be stored in an n-size array called numbers.
Recursive Maximum:
if (n = = ...

#### Solution Summary

This solution is comprised of a detailed explanation to give a recursive definition.

\$2.49