Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #10108
| From | Bob Hanlon <hanlonr357@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: Trying to recursively define a double factorial |
| Date | 2012-05-17 08:12 +0000 |
| Organization | Steven M. Christensen and Associates, Inc and MathTensor, Inc. |
| Message-ID | <jp2bti$4vj$1@smc.vnet.net> (permalink) |
| References | <201205160820.EAA23026@smc.vnet.net> |
myF1[0] = myF1[1] = 1;
myF1[n_Integer?Positive] := n*myF1[n - 2]
And @@ Table[n!! == Factorial2[n] == myF1[n], {n, 0, 256}]
True
Bob Hanlon
On Wed, May 16, 2012 at 4:20 AM, 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?
Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread
Re: Trying to recursively define a double factorial Bob Hanlon <hanlonr357@gmail.com> - 2012-05-17 08:12 +0000
csiph-web