Oh, I was looking at the posts, and noticed that Momerath asked "I wonder how many characters a single post can contain?". I got to thinking that since there's a limit to how many digits the numeric datatypes of some programming languages can contain, how would I go about writing a generalized Fibonacci number generator that wasn't constrained by that limit?

The post I made was one such program. It uses string datatypes, and manipulates each digit independently. It is only limited by the possible length of the "string" datatype for this language (I think it's 32767...I'd have to check). So in theory, it could generate all Fibonacci numbers with 32767 or fewer digits. It uses basically the same technique of the "carry flag" that Assembler uses for register arithmetic.

Does it wreck the posting game? No, not really. I posted the next few numbers in the series on my earlier post, but I did indicate that I had cheated. And I thought that it was a programming technique that was worth sharing...sorry if anyone was offended.