Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #10118 > unrolled thread

Re: Trying to recursively define a double factorial

Started byDrMajorBob <btreat1@austin.rr.com>
First post2012-05-17 08:14 +0000
Last post2012-05-17 08:14 +0000
Articles 1 — 1 participant

Back to article view | Back to comp.soft-sys.math.mathematica

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: Trying to recursively define a double factorial DrMajorBob <btreat1@austin.rr.com> - 2012-05-17 08:14 +0000

#10118 — Re: Trying to recursively define a double factorial

FromDrMajorBob <btreat1@austin.rr.com>
Date2012-05-17 08:14 +0000
SubjectRe: Trying to recursively define a double factorial
Message-ID<jp2c1c$50k$1@smc.vnet.net>
You don't need to do it at all, since Mathematica already has Factorial2  
built in.

Bobby

On Wed, 16 May 2012 03:20:52 -0500, Jorge Cantu <monsterbone@msn.com>  
wrote:

> My goal here is to define a recursive function for a double factorial.   
> The domain of this function is the set of positive integers.  For a  
> positive even integer  n  the value DF[n] is the product of all positive  
> even integers which are  <n.  For a positive odd integer   n   the value  
> DF[n] is the product of all positive odd integers which are <n.
>
> I wanna make a recursive function of this double factorial without  
> If(and other similar statements). Here is my work so far:
>
>
> Clear[MyF1, n];
> MyF1[1] = 1;
> MyF1[n_Integer] /; (n > 0) := MyF1[n] = n*MyF1[n - 1]
>
> Table[MyF1[k], {k, (*integer*), (*integer*)}]
>
>
>
>                How do I do this?
>


-- 
DrMajorBob@yahoo.com

[toc] | [standalone]


Back to top | Article view | comp.soft-sys.math.mathematica


csiph-web