@Carl Love 

Thanks

The use of the until statement, why to apply in what code context is yet not clear for me

@Axel Vogt 

Thanks

Yes,but is now by using a procedure for a general case..for all N 

@acer 

Thanks

Interesting books for starting for programming and hopefully i can make some progress

It is not my goal to go very deep in the programming skills, because its probably not neccesary and difficult

@rlopez 

Thanks

Yes, i did, but decided to use the book short introduction for now.

@acer 

Thanks

Makes it not easier to learn some programming in Maple (only one edition from 2002) 

I think there is no other book what teaches a introduction in programming in Maple ?

Can't folllow your explanation what is all wrong with this procedure  

Must a variable be declared in a procedure to be local ?, if not they are global ? : assigned outside the scope of the procedure   

CD2-6.MWS 

i@Preben Alsholm 

Thanks

The book mathematical computing -An ntroduction to programming using Maple   is way back from 2002 ( don't think there is newer version ? ) 

When i execute the code nothing happens.

@acer 

Thanks 

Makes the graphs really looking good with the legenda! 
i did some adjustment to your code in order to follow the task in two parts
 (part1 :draw 5 deratives, part 2: draw f, f' and f'' and reasoning  geometric the 3 graphs)

betounes_ex_set_task_4def_acc_aangepast.mw 

Thanks

I chanced at start at options the Output display to Maple input,that's the culprit

its my own fault..forget that i did this

Well,it is solved now 

betounes_ex_set_task_4def.mw

Download betounes_ex_set_task_4def.mw

@janhardo 

exercise set 2-task2

So, the fo  rmula for the [i,j] element is i^j , as i goes from 1 to 3 and j goes from 1 to 4. (Realizing this is likely one of the purposes of the execise.)

Download doubleloop.mw

But look at these:

Array(1..3,1..4,(i,j)->i^j);

               [1  1  1   1 ]
               [2  4  8   16]
               [3  9  27  81]

A := Array(1..2,1..4):
for i from 1 to 2 do
  for j from 1 to 4 do
    A[i,j] := i^j;
  end do;
end do:
A;

               [1  1  1  1 ]
               [2  4  8  16]

Array(1..2,1..4,(i,j)->i^j);

               [1  1  1  1 ]
               [2  4  8  16]

@acer 

As you wrote :

@janhardo No, it's not a lot more work. Look, the same approach can be done as in the earlier attachment you gave, CD2-5.MWS. The loops are merged together, as I mentioned could be done.

Is there a benefit to make from one array do loop a two nested do loop ?

G := Array(1..6, 1..3):
P := Array(1..6):
for i from 1 to 6 do
  G[i, 1] := L[i];
  G[i, 2] := df(G[i, 1]);
  G[i, 3] := f(G[i,1])+G[i, 2]*(x-G[i,1]);
  P[i] := plot(G[i,3], x=G[i,1]-1..G[i,1]+1, colour=red);
end do:
-----------------------------------------------

This one does do  the same 

B := Array(1..6,1..3):
for i from 1 to 6 do
  for j from 1 to 3 do
  B[i, 1] := L[i];
  B[i, 2] := df(G[i, 1]);
  B[i, 3] := f(G[i,1])+G[i, 2]*(x-G[i,1]); 
  end do;
end do:
 

@acer 

Thanks!

Now i do see something similar code as in the book, thought first that absence of a regularity in the x-values of f was the problem, but now using a list for random x 

It is better for developing programming skill to use those loops?  
 

"The loops are merged together, as I mentioned could be done."   .... i must look at this ?..ah yes that was the earlier answered task by you  to use a nested do loop for a two-dimensional array

That i think also the intention of the task to use nested do loops , but i can be also be done with a a single loop, if i am i correct.

@acer 

Is it not possible to use a 6x2 array for storing the inflection points and y'

The inflection points  for function f are called by: (calculated earlier by you )
Q := map(p->[p,f(p)], Inflpts);

Question :  those  < >  ?

G[1..6, 1] := <Student:-Calculus1:-Roots(ddf(x), x=0..16, numeric)>;

----------------------------------------------------------

Note : The length of the tangentlines must be on a interval  ( see task ) :  

@acer 

Thanks

Interesting you have worked out the task now with array..could try this approach in my task 

It is a lot of work you did opposite the bookexample code  
But in the bookexample it is drawing tangentlines randomly chosen at  x= 0.5,.1.5,2.5,..,5.5 (regularity)  and x=0.5+(i-1) to fill

with a loop the x-values in a array. 

In the task ex set 2-task 3 there are x -values without regularity , so no general formulae to find for using in a do loop 

I learned a lot now.

There is a lot to study for this introduction programming...MCtoc.mws

@tomleslie 

Thanks

Now  you drawed the tangentlines in the 6 infliction points of  the graph by a procedure.

Not all is clear for me in the procedure how set this up by you, but that's way i try to learnn programming from the book.

I thought in English language that inflection points also included mins and maxs of a function

That's way i started with a first derative of the function

Next time i give a screenshot of the question of the task , so there will be no room for errors