Search Results for ""

The identity _2F_1(x,-x;x+n+1;-1)=(Gamma(x+n+1)Gamma(1/2n+1))/(Gamma(x+1/2n+1)Gamma(n+1)), or equivalently ...

The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.

The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, ...

Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...

The scramble number sn(G) of a graph G is a graph invariant developed to aid in the study of gonality of graphs. The scramble number is NP-hard to compute (Echavarria et al. ...

If the sides of a triangle are divided in the ratios lambda:1, mu:1, and nu:1, the cevians form a central triangle whose area is ...

int_a^b(del f)·ds=f(b)-f(a), where del is the gradient, and the integral is a line integral. It is this relationship which makes the definition of a scalar potential function ...

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, then there exists a B_3 in S such ...

Given three circles, each intersecting the other two in two points, the line segments connecting their points of intersection satisfy (ace)/(bdf)=1 (Honsberger 1995).

An a×b rectangle can be packed with 1×n strips iff n|a or n|b.