| Ticket UUID: | 484850 | |||
| Title: | Add "log-gamma" proc to math module | |||
| Type: | RFE | Version: | None | |
| Submitter: | lvirden | Created on: | 2001-11-23 12:49:51 | |
| Subsystem: | math | Assigned To: | kennykb | |
| Priority: | 5 Medium | Severity: | ||
| Status: | Closed | Last Modified: | 2002-01-12 07:57:45 | |
| Resolution: | Closed By: | kennykb | ||
| Closed on: | 2002-01-12 00:57:45 | |||
| Description: |
The tcler's wiki has several procs implementing factorial code. It would be useful, once one decided which of the implementations matched the current math module style, to add one to the math modu | |||
| User Comments: |
kennykb added on 2002-01-12 07:57:45:
Logged In: YES user_id=99768 'combinatorics' submodule added to the 'math' module. kennykb added on 2001-12-15 04:50:02: File Added - 14713: combinatorics.patch kennykb added on 2001-12-15 04:49:56: Logged In: YES user_id=99768 one more try at patch kennykb added on 2001-12-15 04:24:03: Logged In: YES user_id=99768 Patches attached. Anyone have any comments before I write the man page? andreas_kupries added on 2001-12-12 04:15:16: Logged In: YES user_id=75003 What is your opinion, kevin ? jenglish added on 2001-12-10 00:46:40: Logged In: YES user_id=68433 Would this really be useful? ISTM that factorial is mostly useful as an example demonstrating how to implement recursively-defined functions; it's rarely used in real applications. (E.g., it's a really bad idea to explicitly calculate n! in combinatorics problems due to overflow issues; usually the gamma function is a better choice.) | |||
Attachments:
- combinatorics.patch [download] added by kennykb on 2001-12-15 04:49:57. [details]