Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>SEPHER</strong> <strong>SEPHIROTH</strong><br />
3283 7 3293 37 3301 P. 3309 — 3317 31<br />
3287 19 3297 — 3303 — 3311 7 3319 P.<br />
3289 11 3299 P. 3307 P. 3313 P. 3321 —<br />
3291 —<br />
The first dozen factorials, and sub-factorials; and the ratios they bear to<br />
one another; note that |n / ||n = e<br />
xv<br />
N |N ||N |N ÷ ||N ||N ÷ |N<br />
1<br />
2<br />
3<br />
4<br />
5<br />
6<br />
7<br />
8<br />
9<br />
10<br />
11<br />
12<br />
1<br />
2<br />
6<br />
24<br />
120<br />
720<br />
5040<br />
40320<br />
362880<br />
2628800<br />
39916800<br />
479001600<br />
0<br />
1<br />
2<br />
9<br />
44<br />
265<br />
1854<br />
14833<br />
133496<br />
1334961<br />
14684570<br />
176214841<br />
∞<br />
2.000000<br />
3.000000<br />
2.666666<br />
2.727272<br />
2.716981<br />
2.718446<br />
2.718262<br />
2.718283<br />
2.718281<br />
2.718281<br />
2.718281<br />
0.000000<br />
0.500000<br />
0.333333<br />
0.375000<br />
0.366666<br />
0.368055<br />
0.367857<br />
0.367881<br />
0.367879<br />
0.367879<br />
0.367879<br />
0.367879<br />
Factorial n, or ƒn is the continued product of all the whole numbers from 1 to n inclusive and is<br />
the number of ways in which n different things can be arranged.<br />
Sub-factorial n, or ||n, is the nearest whole number to n ÷ e, and is the number of ways in which a<br />
row of n elements may be so deranged, that no element may have its original position.<br />
Thus ƒn = 1 × 2 × 3 × . . . × n,<br />
1×<br />
2×<br />
3×<br />
... × n<br />
and ||n = ± h ,<br />
2.<br />
71828188...<br />
1×<br />
2×<br />
3×<br />
... × n<br />
where h is the smaller decimal fraction less than unity by which the fraction<br />
differs from a<br />
2.<br />
71828188...<br />
whole number, and is to be added or subtracted as the case may be.—The most useful expression for<br />
||n is:<br />
||n ≡ n n(<br />
n − 1)<br />
n(<br />
n − 1)(<br />
n − 2)<br />
etc<br />
n! − ( n − 1)!<br />
+ ( n − 2)!<br />
−<br />
( n − 3)!<br />
+<br />
1 1⋅2<br />
1⋅2<br />
⋅3<br />
to (n+1) terms.<br />
1 1 1<br />
e ≡ 1 + + + + ... to ∞<br />
1!<br />
2!<br />
3!<br />
≡ 2.71828188... .