The square grid is given in the Euclidean plane. All grid points therefore have integer coordinates. Investigate whether there are three points in this grid plane that form an equilateral triangle.

A regular polygon with n sides of length 1 is drawn. Then, the n midpoints of the edges are used to create another regular polygon inside the first. What is the length of an edge of the new polygon? As n approaches infinity, what does this length approach?

Hopefully this task is suitable for Maple?

Inspired by the task "With two cuts into 4 equal areas" I remember the following old task:

How can you divide a cube into 6 pyramids so that their volumes are 1 : 2 : 3 : 4 : 5 : 6?

We are looking for all triangles (with the exception of similarity) in which the tangent values ​​of the interior angles are all integers.

In Peter Winkler's book "Mathematical Mind-Benders" the now famous problem of dividing an ice cream cake is posed. It asks: If, when cutting the circular cake with any central angle (whether rational or irrational), neighboring piece after neighboring piece is constantly cut off, the cake segment is rotated to the previous top side, and the cut surface is considered to be healed, then after a finite number of cuts the top side is back where it was at the beginning. I also fell for it at first and assumed that according to Weyl's theorem (uniform distribution modulo 1) this is not possible and therefore the central angle must be rational. I have since found a solution according to which the cutting process must stop after a finite number of steps. Weyl's theorem is obviously not applicable here. Why - I am still puzzling over that.

Now I am interested in whether Maple can be used to animate the uniform distribution modulo 1 on the unit circle and to display the associated statistics in the sense of a sample and calculate the sample value of the uniform distribution. As a Maple beginner, I am not yet able to do this and am asking for help.