Search Results for ""

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 ...

An integer sequence given by the recurrence relation a(n)=a(a(n-2))+a(n-a(n-2)) with a(1)=a(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, ...

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

The number of nonassociative n-products with k elements preceding the rightmost left parameter is F(n,k) = F(n-1,k)+F(n-1,k-1) (1) = (n+k-2; k)-(n+k-1; k-1), (2) where (n; k) ...

There are a number of functions in mathematics denoted with upper or lower case Qs. 1. The nome q. 2. A prefix denoting q-analogs and q-series. 3. Q_n or q_n with n=0, 1, 2, ...

int_(-infty)^infty(J_(mu+xi)(x))/(x^(mu+xi))(J_(nu-xi)(y))/(y^(nu-xi))e^(itxi)dxi =[(2cos(1/2t))/(x^2e^(-it/2)+y^2e^(it/2))]^((mu+nu)/2) ...

There exist numbers y_1<y_2<...<y_(n-1), a<y_(n-1), y_(n-1)<b, such that lambda_nu=alpha(y_nu)-alpha(y_(nu-1)), (1) where nu=1, 2, ..., n, y_0=a and y_n=b. Furthermore, the ...

Let f(1)=1, and let f(n) be the number of occurrences of n in a nondecreasing sequence of integers. then the first few values of f(n) are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, ... ...

The squeeze theorem, also known as the squeezing theorem, pinching theorem, or sandwich theorem, may be stated as follows. Let there be two functions f_-(x) and f_+(x) such ...

Let N be an odd integer, and assume there exists a Lucas sequence {U_n} with associated Sylvester cyclotomic numbers {Q_n} such that there is an n>sqrt(N) (with n and N ...