restricted%20integer%20partitions
(0.004 seconds)
11—20 of 619 matching pages
11: 8 Incomplete Gamma and Related
Functions
…
12: 28 Mathieu Functions and Hill’s Equation
…
13: 27.15 Chinese Remainder Theorem
…
►For example, suppose a lengthy calculation involves many 10-digit integers.
Most of the calculation can be done with five-digit integers as follows.
…Their product has 20 digits, twice the number of digits in the data.
By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod ), (mod ), (mod ), and (mod ), respectively.
…These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result , which is correct to 20 digits.
…
14: 15.7 Continued Fractions
…
15: 8.26 Tables
…
►
•
…
►
•
…
►
•
…
►
•
Khamis (1965) tabulates for , to 10D.
Abramowitz and Stegun (1964, pp. 245–248) tabulates for , to 7D; also for , to 6S.
Pagurova (1961) tabulates for , to 4-9S; for , to 7D; for , to 7S or 7D.
Zhang and Jin (1996, Table 19.1) tabulates for , to 7D or 8S.
16: 23 Weierstrass Elliptic and Modular
Functions
…
17: 26.15 Permutations: Matrix Notation
…
►
26.15.2
►where the sum is over and .
…
►A permutation with restricted position specifies a subset .
…
►
26.15.3
…
►
26.15.6
…
18: 11.6 Asymptotic Expansions
19: 10.44 Sums
…
►
10.44.1
.
►If and the upper signs are taken, then the restriction on is unnecessary.
…
►
10.44.3
.
►The restriction
is unnecessary when and is an integer.
…
►
10.44.6
…