In article ,
Mark Rand wrote:
On Sun, 05 Dec 2004 07:37:22 GMT, "Martin H. Eastburn"
wrote:



The method I employed was to set up an array of integers of the F size.
e.g. Not so easy to guess when the numbers get large, but 1000! is under 2000 digits.

Then take the first two numbers and multiply, place the results into the array.
Multiply that by the next number - and when done, make sure each array element is a
single digit. If not - bump it up.... and re-test...

This then takes massive numbers and puts them into very simple baby talk numbers.
Any system can handle one digit vs. another. (unless it were a 4 bit o.s. :-) )

Martin

What's that Martin? You got some sort of prejudice against BCD???

Doe the 4-bit OS (and CPU) have provisions for handling overflow --
e.g. add 9 and 9 and you get 18 (0x12), which overflows the 4-bit
values. And if you need to handle *signed* numbers, your maximum value
is 7 -- one more becomes a negative number.

Enjoy,
DoN.

--
Email: | Voice (all times): (703) 938-4564
(too) near Washington D.C. | http://www.d-and-d.com/dnichols/DoN.html
--- Black Holes are where God is dividing by zero ---