Search Results for ""
1961 - 1970 of 3209 for Subset sum problemSearch Results
The negabinary representation of a number n is its representation in base -2 (i.e., base negative 2). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...
The negadecimal representation of a number n is its representation in base -10 (i.e., base negative 10). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...
Newton's forward difference formula is a finite difference identity giving an interpolated value between tabulated points {f_p} in terms of the first value f_0 and the powers ...
A nexus number is a figurate number built up of the nexus of cells less than n steps away from a given cell. The nth d-dimensional nexus number is given by N_d(n) = ...
Let S_N(s)=sum_(n=1)^infty[(n^(1/N))]^(-s), (1) where [x] denotes nearest integer function, i.e., the integer closest to x. For s>3, S_2(s) = 2zeta(s-1) (2) S_3(s) = ...
The noncentral chi-squared distribution with noncentrality parameter lambda is given by P_r(x) = ...
An odd power is a number of the form m^n for m>0 an integer and n a positive odd integer. The first few odd powers are 1, 8, 27, 32, 64, 125, 128, 216, 243, 343, 512, ... ...
Approximants derived by expanding a function as a ratio of two power series and determining both the numerator and denominator coefficients. Padé approximations are usually ...
Odd values of Q(n) are 1, 1, 3, 5, 27, 89, 165, 585, ... (OEIS A051044), and occur with ever decreasing frequency as n becomes large (unlike P(n), for which the fraction of ...
Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...
...
View search results from all Wolfram sites (180219 matches)

