Increase the above number by one until the current progress is deleted and started from scratch

  • Thread starter IntrusivePenDesperateSword
  • Start date
202.
The number of partitions of 32 into smaller powers of two. Also the number of non-congruent distinct polygons that can be formed by connecting all eight vertices of a regular octagon into a cycle, and the number of non-isomorphic directed graphs on four unlabeled vertices, not having any isolated vertices.

uFDiG3J.png