Search Results for ""

There are several related series that are known as the binomial series. The most general is (x+a)^nu=sum_(k=0)^infty(nu; k)x^ka^(nu-k), (1) where (nu; k) is a binomial ...

The Abel-Plana formula gives an expression for the difference between a discrete sum and the corresponding integral. The formula can be derived from the argument principle ...

The series which arises in the binomial theorem for negative integer -n, (x+a)^(-n) = sum_(k=0)^(infty)(-n; k)x^ka^(-n-k) (1) = sum_(k=0)^(infty)(-1)^k(n+k-1; k)x^ka^(-n-k) ...

The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...

A binomial coefficient (N; k) is said to be exceptional if lpf(N; k)>N/k. The following table gives the exception binomial coefficients which are also good binomial ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

Let p be prime and r = r_mp^m+...+r_1p+r_0 (0<=r_i<p) (1) k = k_mp^m+...+k_1p+k_0 (0<=k_i<p), (2) then (r; k)=product_(i=0)^m(r_i; k_i) (mod p). (3) This is proved in Fine ...

The Christmas stocking theorem, also known as the hockey stick theorem, states that the sum of a diagonal string of numbers in Pascal's triangle starting at the nth entry ...

A polynomial with 2 terms.

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...