Search Results for ""
3091 - 3100 of 4435 for Triangle FunctionSearch Results
The fibonomial coefficient (sometimes also called simply the Fibonacci coefficient) is defined by [m; k]_F=(F_mF_(m-1)...F_(m-k+1))/(F_1F_2...F_k), (1) where [m; 0]_F=1 and ...
One of the beautiful arrangements of circles found at the Temple of Osiris at Abydos, Egypt (Rawles 1997). The pattern also appears in Phoenician art from the 9th century BC ...
If two intersections of each pair of three conics S_1, S_2, and S_3 lie on a conic S_0, then the lines joining the other two intersections of each pair are concurrent (Evelyn ...
Consider a string of length 2L plucked at the right end and fixed at the left. The functional form of this configuration is f(x)=x/(2L). (1) The components of the Fourier ...
The term "fractal dimension" is sometimes used to refer to what is more commonly called the capacity dimension of a fractal (which is, roughly speaking, the exponent D in the ...
Let a spherical triangle have sides a, b, and c with A, B, and C the corresponding opposite angles. Then (sin[1/2(a-b)])/(sin(1/2c)) = (sin[1/2(A-B)])/(cos(1/2C)) (1) ...
The golden angle is the angle that divides a full angle in a golden ratio (but measured in the opposite direction so that it measures less than 180 degrees), i.e., GA = ...
Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...
The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...
Any one of the eight Apollonius circles of three given circles is tangent to a circle H known as a Hart circle, as are the other three Apollonius circles having (1) like ...
...
View search results from all Wolfram sites (417657 matches)

