Search Results for ""

The first and second Zagreb indices for a graph with vertex count n and vertex degrees v_i for i=1, ..., n are defined by Z_1=sum_(i=1)^nv_i^2 and Z_2=sum_((i,j) in ...

The number of ways a set of n elements can be partitioned into nonempty subsets is called a Bell number and is denoted B_n (not to be confused with the Bernoulli number, ...

A correction to a discrete binomial distribution to approximate a continuous distribution. P(a<=X<=b) approx P((a-1/2-np)/(sqrt(np(1-p)))<=z<=(b+1/2-np)/(sqrt(np(1-p)))), ...

A multinomial series is generalization of the binomial series discovered by Johann Bernoulli and Leibniz. The multinomial series arises in a generalization of the binomial ...

A q-analog of the multinomial coefficient, defined as ([a_1+...+a_n]_q!)/([a_1]_q!...[a_n]_q!), where [n]_q! is a q-factorial.

Let {f_n} and {a_n} be sequences with f_n>=f_(n+1)>0 for n=1, 2, ..., then |sum_(n=1)^ma_nf_n|<=Af_1, where A=max{|a_1|,|a_1+a_2|,...,|a_1+a_2+...+a_m|}.

Let A be a unital Banach algebra. If a in A and ||1-a||<1, then a^(-1) can be represented by the series sum_(n=0)^(infty)(1-a)^n. This criterion for checking invertibility of ...

Given a series of the form A(z)=sum_(k)a_kz^k, the notation [z^k](A(z)) is used to indicate the coefficient a_k (Sedgewick and Flajolet 1996). This corresponds to the Wolfram ...

A method of determining coefficients alpha_l in an expansion y(x)=y_0(x)+sum_(l=1)^qalpha_ly_l(x) so as to nullify the values of an ordinary differential equation L[y(x)]=0 ...

Let n objects be picked repeatedly with probability p_i that object i is picked on a given try, with sum_(i)p_i=1. Find the earliest time at which all n objects have been ...