Let (m mod n) denote the remainder when m is divided by n. Then your function is ((n - 1) mod 12) + 1.
I'm terrible at maths, but I'm usually OK at generating a formula to feed a calculator or put in code.
But for some reason, this has stumped me.
I'm not even sure its meant to be in this forum, if not, please move it.
I have a colour coded sequence pattern, there are 12 colours, each colour is associated with a number.
Lets say... blue is 1, green is 2, yellow is 3, and so on until 12.
Once you go beyond 12, it wraps back to the colour of 1 again.
So 13 would be blue, 14 would be green, 15 yellow, etc etc.
How would I work this out mathematically on any number?
ie. 25 should be blue.
Thanks in advance, I know the problem is right in front of me but I cannot seem to make it clear!