Find a simpler form for Module[{a,i},a=0; For[i=1,i≤1000,i++,a=i*(i+1)+a];a].

46.1

[ Click to enter code ]

Find a simpler form for Module[{a,i},a=x; For[i=1,i≤10,i++, a=1/(1+a)];a].

46.2

[ Click to enter code ]

Find a simpler form for Module[{i,j,a},a={}; For[i=1,i≤10,i++,For[j=1,j≤10,j++,a=Join[a,{i,j}]]];a].

46.3

[ Click to enter code ]

Make a line plot of the timing for computing n^n for n up to 10000.

46.4

[ Click to enter code ]

Make a line plot of the timing for Sort to sort Range[n] from a random order, for n up to 200.

46.5

[ Click to enter code ]