Search Results for ""
1751 - 1760 of 2487 for Prime SumsSearch Results
A k-subset is a subset of a set on n elements containing exactly k elements. The number of k-subsets on n elements is therefore given by the binomial coefficient (n; k). For ...
A q-analog of the beta function B(a,b) = int_0^1t^(a-1)(1-t)^(b-1)dt (1) = (Gamma(a)Gamma(b))/(Gamma(a+b)), (2) where Gamma(z) is a gamma function, is given by B_q(a,b) = ...
The q-analog of the binomial theorem (1-z)^n=1-nz+(n(n-1))/(1·2)z^2-(n(n-1)(n-2))/(1·2·3)z^3+... (1) is given by (1-z/(q^n))(1-z/(q^(n-1)))...(1-z/q) ...
There are several q-analogs of the cosine function. The two natural definitions of the q-cosine defined by Koekoek and Swarttouw (1998) are given by cos_q(z) = ...
Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...
A q-analog of Gauss's theorem due to Jacobi and Heine, _2phi_1(a,b;c;q,c/(ab))=((c/a;q)_infty(c/b;q)_infty)/((c;q)_infty(c/(ab);q)_infty) (1) for |c/(ab)|<1 (Gordon and ...
The modern definition of the q-hypergeometric function is _rphi_s[alpha_1,alpha_2,...,alpha_r; beta_1,...,beta_s;q,z] ...
The q-analog of integration is given by int_0^1f(x)d(q,x)=(1-q)sum_(i=0)^inftyf(q^i)q^i, (1) which reduces to int_0^1f(x)dx (2) in the case q->1^- (Andrews 1986 p. 10). ...
There are several q-analogs of the sine function. The two natural definitions of the q-sine defined by Koekoek and Swarttouw (1998) are given by sin_q(z) = ...
If p divides the numerator of the Bernoulli number B_(2k) for 0<2k<p-1, then (p,2k) is called an irregular pair. For p<30000, the irregular pairs of various forms are p=16843 ...
...
View search results from all Wolfram sites (13197 matches)

