This project has to be downloaded to work properly. This is my attempt to implement Fourier division, which is a method for breaking up a division problem where the input and/or output string is so long that calculators and programs round off the answer. The program breaks up the dividend and divisor into 2-digit chunks and uses those chunks in an algorithm to create the answer list. Finally, it converts the answer list into a single string of digits (with no decimal -- you have to figure out where the decimal goes). The Wikipedia article on "Fourier Division" contains a good explanation of the algorithms I've used here. Known Problems: - This program works for most pairs of numbers, but for certain pairs, you'll notice that the members of the answer list grow rapidly, eventually becoming so large that they are represented by scientific notation, and so is the final answer. I'm not sure why this happens, but I have an idea. - When you specify the number of digits you want in the output, that's how many you get, but often the last few digits are not accurate. If the program started with more digits and then rounded it off, the output would be more accurate, but I didn't bother. - The program can't handle decimal points in the input and doesn't include them in the output, but that's also a limitation of Fourier Division.
