In the attached file, I would like to calculate the expressions for the function f(n,x) using a recursion for a given index range, e.g., n=3..15. I would appreciate any advice on this.
 

Download test24c.mw

I would like to solve an equation in the attached file as an exercise. I am looking for all solutions - including the complex ones. This is easily done using "derive". There are six solutions:

edited "test":

test.mw

Five are complex, and the single real solution can be guessed simply by taking a close look. I am unable to obtain the complete solution in Maple; I cannot find my mistake and would appreciate some advice.

The integral shown in the attached file "test" was posted on another forum for calculation. I unsuccessfully attempted to apply Green's theorem in Maple and—as befits a Maple beginner—failed. Does Maple offer a sequence of commands to carry this out? I would appreciate some advice. If this is possible, I would then tackle the line integral using the residue theorem.

Download test.mw

For exercises involving Pick's Theorem, I need grid points within a Cartesian coordinate system. How can "all" grid points - at least within the first quadrant - be generated without the tedious manual entry of integer coordinates? Is it possible to draw grid polygons as closed polylines simply by clicking on the grid points? (BTW: At the moment, this works well in the good old "Cabri.")
My search within the "Help" section (using terms such as plot, grid, mesh, lattice, etc.) proved unsuccessful.

For quite some time, I have wanted to solve the system attached in "test" using Maple. The smallest solution in natural numbers x, y, and z test.mw

Download test.mw

is known, and all these numbers are less than 4 × 10¹². Is this possible in Maple?

(x=1633780814400; y=252782198228; z=3474741058973)