Is there a generic formula for performing a modulus operation on a number that is in base 'n'? If not, what's the best way of performing a modulus on a very large number that is not in base 10?
Also, I still want more.
An idea I had for recreation is a black background with a few overlapping gradients from one end to the other. Then to run it through some sort of blurring kernel, add noise, and tweak sharpness.
I would like to know where it came from, or how it was generated.
I am actually an 1st year CS undergraduate, and was interested in finding a quick generic method but I have resorted to converting the number to base 10, then using Google to take the modules of each 'unit' of the input and adding the remainders so I have something manageable.
CS majors man. Just be happy that they can dress themselves.
No there isn't because in different bases you have different numbers of symbols and the symbols you used in one base has a different meaning in another base. all modulus operations will work regardless of base so just pick one and stick to it or convert in and out of whichever base suits you best.
I love that Irony that that message was entered, processed, transmitted, received and decoded using complex systems and techniques invented and built by people who probably majored in CS...