Is anyone able to calculate the rough value of the number of squares in a piece of graph paper, specifically five star 3 ring graph paper? I'm quite curious on the best way to solve this question. Will resolve to the most convincing comment.

🏅 Top traders
| # | Trader | Total profit |
|---|---|---|
| 1 | Ṁ67 | |
| 2 | Ṁ42 | |
| 3 | Ṁ19 | |
| 4 | Ṁ6 | |
| 5 | Ṁ5 |
Each square has precisely one top left corner.
Each grid point is a top left corner for squares of size between 1 and the smaller of the distances from it to the right and bottom edge.
There are 32x43 unit squares in the picture.
Putting it all together:

There should exist a closed form solution but this works
@CodeandSolder Actually, the closed form is quite simple, there are 1x1 squares with a top left corner in each point except the ones on the bottom and right row, 2x2 from all except their last two and so on, so a sum for x[1-32] of x*(x+11)
Wolfram helpfully tells us:

Which after substituting 32 for x gives us 17248.
Which, after remembering how range() works checks out:

I now understand that I misunderstood the question entirely <shame>