Write in Maple : A sequence is given by the recurrence relation a n = (3 a n1 )

Question

Write in Maple :

A sequence is given by the recurrence relation

an = (3 an1) (2 an2) + (an3)

where the integer n 3, a0 = 1, a1 = 2, and a2 = 1.
Write a recursive procedure that has n as its only input parameter and returns the value of
an .
Your procedure should check that n is of the right type and in the right range, and if it is not it should return an error message. Call your procedure with n = 2.2 and n = 3 to check that your out of range error checks work. Then write a main program which calls your procedure to print out a table of n and an for n = 0, 1, 2, . . . 10. Your table should have headers.

Explanation / Answer

Hey, Could you please give me the points cuz I really need them... I promise to return the favor...

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.