home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.misc
- Path: sparky!uunet!stanford.edu!rock!taco!tmjones
- From: tmjones@eos.ncsu.edu (@large(Are you Object-Oriented?))
- Subject: Question
- Message-ID: <1993Jan27.204439.15769@ncsu.edu>
- Originator: tmjones@c00538-106ps.eos.ncsu.edu
- Sender: news@ncsu.edu (USENET News System)
- Reply-To: tmjones@eos.ncsu.edu (@large(Are you Object-Oriented?))
- Organization: North Carolina State University, Project Eos
- References: <ALEXEEV.93Jan25142041@solitude.math.utah.edu> <1993Jan26.211823.10586@spider.research.ptt.nl>
- Distribution: comp
- Date: Wed, 27 Jan 1993 20:44:39 GMT
- Lines: 9
-
-
- I have a problem. I need to figure up an algorithm to calculate large
- factorials. The largest factorial I'll need is 90! I see how I can store
- the numbers in arrays of bits, but I have no idea how to calculate it.
- Can anyone help me.
- --
- ------------
- Tommie Miles Jones North Carolina State University
- Computer Science
-