In the previous story https://pro.nftaggregator.io/nfts-family-based-on-math-theorem/ I shared my work on how to fragment polygons in n tiles according to the factors of n, the following image is taken from the previous post.
I am now sharing some progress that I made on two directions : shape and colors.
Shape : I linked the initial shape to the lowest factor of n and I achieved additional symmetry, for example in the story image I start with a 7-sides polygon because n is a multiple of 7.
Colors : I connected the average value of hue to an additional property and math-mystery of n. The sum of proper divisors of n can be higher, equal or lower than n itself. If it is equal n is defined “perfect” (since 2000 years we do not know how many “perfect numbers” exist… for example 28=1+2+4+7+14 is perfect). I connected the average of hue to the sum of divisors of n divided by n, in this way “low factored” n are colder (bluish) and “high factored n” are wormer (reddish).
The end result for n=19019=7x11x13x19 is in the following NFT, I minted a single item on the NFTAggregator marketplace. This is one of my favorite integers for the improved algorithm, it is made by 4 close primes without multiplicity.