Search Results for ""
521 - 530 of 1130 for Combinatorial FormulasSearch Results
A pair (M,omega), where M is a manifold and omega is a symplectic form on M. The phase space R^(2n)=R^n×R^n is a symplectic manifold. Near every point on a symplectic ...
cos(pi/(15)) = 1/8(sqrt(30+6sqrt(5))+sqrt(5)-1) (1) cos((2pi)/(15)) = 1/8(sqrt(30-6sqrt(5))+sqrt(5)+1) (2) cos((4pi)/(15)) = 1/8(sqrt(30+6sqrt(5))-sqrt(5)+1) (3) ...
cos(pi/(16)) = 1/2sqrt(2+sqrt(2+sqrt(2))) (1) cos((3pi)/(16)) = 1/2sqrt(2+sqrt(2-sqrt(2))) (2) cos((5pi)/(16)) = 1/2sqrt(2-sqrt(2-sqrt(2))) (3) cos((7pi)/(16)) = ...
Values of the trigonometric functions can be expressed exactly for integer multiples of pi/20. For cosx, cos(pi/(20)) = 1/4sqrt(8+2sqrt(10+2sqrt(5))) (1) cos((3pi)/(20)) = ...
The word configuration is sometimes used to describe a finite collection of points p=(p_1,...,p_n), p_i in R^d, where R^d is a Euclidean space. The term "configuration" also ...
A generating function f(x) is a formal power series f(x)=sum_(n=0)^inftya_nx^n (1) whose coefficients give the sequence {a_0,a_1,...}. The Wolfram Language command ...
The mathematical study of the properties of the formal mathematical structures called graphs.
The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...
A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...
A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...
...
View search results from all Wolfram sites (56183 matches)

