P versus NP.
Hodge conjecture.
Riemann hypothesis.
Yang–Mills existence and mass gap.
Navier–Stokes existence and smoothness.
Birch and Swinnerton-Dyer conjecture.

Explanation:

The problem of P versus NP is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly. ... The class of questions for which an answer can be verified in polynomial time is called NP, which stands for "nondeterministic polynomial time". I don't know this answer, more to read about.

earliest

neumes above text

neumes

colored lines

neumes

4-line staff

f, c, or g clef

notes on 5-line staff with clef

mensuration (longas and breves)

time signature (perfect or half circle)

most recent

notes on 5-line staff

modern clefs

modern note values (whole, half, quarter, and so on)

modern time signature

italian words and abbreviations for dynamics and tempo

staccato, slurs, and so on

the above mentioned statements talks about the creativity of an artist and to what extend they can utilize and experiment on the objects provided.   differing size and subjects are given so that an image of wisdom is created. displaying a transition from light to dark in something by darkening sections in order to create a shadow. and lastly, putting bits and pieces together to formulate a new image.