TOPICS
Search

Search Results for ""


801 - 810 of 1131 for Geometric ProofSearch Results
A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...
Concentric circles are circles with a common center. The region between two concentric circles of different radii is called an annulus. Any two circles can be made concentric ...
The problem of finding the connection between a continuous function f on the boundary partialR of a region R with a harmonic function taking on the value f on partialR. In ...
_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...
A hypergeometric identity discovered by Ramanujan around 1910. From Hardy (1999, pp. 13 and 102-103), (1) where a^((n))=a(a+1)...(a+n-1) (2) is the rising factorial (a.k.a. ...
If two perpendicular lines are drawn through the orthocenter H of any triangle, these lines intercept each side (or its extension) in two points (labeled P_(12), P_(12)^', ...
A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...
Let a closed surface have genus g. Then the polyhedral formula generalizes to the Poincaré formula chi(g)=V-E+F, (1) where chi(g)=2-2g (2) is the Euler characteristic, ...
Let X be a set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A in V(X) be a finitary algebra with finitely many fundamental operations. Then ...
The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...
1 ... 78|79|80|81|82|83|84 ... 114 Previous Next

...