Re: What is Data Model FOR?

From: Arthur Keller <arthur_at_kellers_dot_org>
Date: Thu Apr 29 2004 - 16:34:03 CDT

At 2:12 PM -0700 4/29/04, Daniel Lifschitz wrote:
>Darn, I got beat to it.
>I also wanted to mention I'll have some time this summer from June
>10th to July 13th before I go abroad to help out. Since I know a lot
>of this goes on in my area feel free to give me a call if you guys
>need a lacky to get your coffee =).
>-Daniel Lifschitz
>(Hopefully it won't be to get coffee though)

It will probably be to critique systems analysis and design plans and
to research appropriate details of them.

Best regards,

>On Thu, 29 Apr 2004 11:20:05 -0700
> Arthur Keller <> wrote:
>>At 11:10 AM -0700 4/29/04, Alan Dechert wrote:
>>> > Dear Daniel, thanks for your message. n! is good enough closed form
>>>> for me. But n! only gives you the full permutations of n!
>>>> candidates, not the partial permutations of up to n candidates. Do
>>>> you have a formula for that? Do you want to derive it?
>>>We went over this some time ago:
>>>The unordered combinations of n things taken k at a time is given by
>>>n!/(k! * (n-k)!)
>>David gave the answer anyway I wanted for ordered partial
>>combinations. It'd be interesting to see what the actual numbers
>>turn out to be.
>>Best regards,
>>Arthur M. Keller, Ph.D., 3881 Corina Way, Palo Alto, CA 94303-4507
>>tel +1(650)424-0202, fax +1(650)424-0424

Arthur M. Keller, Ph.D., 3881 Corina Way, Palo Alto, CA  94303-4507
tel +1(650)424-0202, fax +1(650)424-0424
= The content of this message, with the exception of any external 
= quotations under fair use, are released to the Public Domain    
Received on Fri Apr 30 23:17:25 2004

This archive was generated by hypermail 2.1.8 : Fri Apr 30 2004 - 23:17:29 CDT