I have thought of a horrible way to do it, but it would take so long to test that I can't really write it. Basically, continually calculate Pi, converting each digit into binary, then look for the binary representation of 'hello' and then do it all again for 'world'. Then take those indexes, and generate pi again to get to that index, and print the ascii representation of that part. Stupid and inefficient? Most definitely!
They'll be in there somewhere (and here's the locations: hello and world). If you remove the space and punctuation, you'd be looking a LOT longer (exponentially longer, I imagine ;) ). It's not in the first 4 billion digits.
Capitalisation and punctuation while looking for the exact string would probably turn this into something that takes longer than your lifetime.. I don't know.
I have thought of a horrible way to do it, but it would take so long to test that I can't really write it. Basically, continually calculate Pi, converting each digit into binary, then look for the binary representation of 'hello' and then do it all again for 'world'. Then take those indexes, and generate pi again to get to that index, and print the ascii representation of that part. Stupid and inefficient? Most definitely!
They'll be in there somewhere (and here's the locations: hello and world). If you remove the space and punctuation, you'd be looking a LOT longer (exponentially longer, I imagine ;) ). It's not in the first 4 billion digits.
Capitalisation and punctuation while looking for the exact string would probably turn this into something that takes longer than your lifetime.. I don't know.