Question: Finding Recursive Algorithm Using Maple

How do I use Maple to demonstrate a recursive algorithm for finding the sum of the first n positive integers

This is my work

if n = 1 then sum of first(n) :=1

else sum of first(n) :=sum of first(n-1)+n

 

Any suggestions?

 

Take care

Please Wait...