Challenge: determine the intended value of the following base two number. You will need to find out which base the number was originally in (it should become obvious when you are right) http://paste.pocoo.org/show/558911/ (pastebinned for convenience)
1. Determine the number of bits in that huge base two number (just put it in a std::string and get the size of the string).
2. Do a prime factorization of that
3. The number of bits in the the original radix of the number must be one of the factors
For the problem to have a unique answer, the number of bits must be a prime number.
(I am assuming that leading zero bits in the binary representation have not been removed; if they have been, there are an unlimited number of correct answers.)
If the intended value is not the value that is expressed by the base two number, there is no way to determine the intended value. Expressing the value via a particular base requires a particular representation, but the value remains the same despite the different representation.
By way of example, the value represented by 10 as a binary number is the same value represented by 2 in base 10. No matter what base you use, it is the same distance from 0.
Seems terribly arbitrary to me. What am I getting wrong?
So write something like this, and pick up the radix and the output for whatever you fancy forms a 'message'. If you are Claude Shannon, you may pick up any one of them at random; all of them are 'messages'.