TOPICS
Search

Search Results for ""


4041 - 4050 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...
For a form Q, the generic character chi_i(Q) of Q is defined as the values of chi_i(m) where (m,2d)=1 and Q represents m: chi_1(Q), chi_2(Q), ..., chi_r(Q) (Cohn 1980, p. ...
2^(30)=1024^3=1073741824 bytes. Although the term gigabyte is sometimes used to refer to 1024^3 bytes, such usage is deprecated in favor of the standard SI naming convention ...
Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...
A necessary and sufficient condition that there should exist at least one nondecreasing function alpha(t) such that mu_n=int_(-infty)^inftyt^ndalpha(t) for n=0, 1, 2, ..., ...
The Harada-Norton group is the sporadic group HN of order |HN| = 273030912000000 (1) = 2^(14)·3^6·5^6·7·11·19. (2) It is implemented in the Wolfram Language as ...
The Held group is the sporadic group He of order |He| = 4030387200 (1) = 2^(10)·3^3·5^2·7^3·17. (2) It is implemented in the Wolfram Language as HeldGroupHe[].
The Heronian mean of two numbers a and b is defined as HM(a,b) = 1/3(2A+G) (1) = 1/3(a+sqrt(ab)+b), (2) where A is the arithmetic mean and G the geometric mean. It arises in ...
The hexanacci constant is the limiting ratio of adjacent hexanacci numbers. It is the algebraic number P = (x^6-x^5-x^4-x^3-x^2-x-1)_2 (1) = 1.98358284342... (2) (OEIS ...
The hypocycloid x = a/(a-2b)[(a-b)cosphi-bcos((a-b)/bphi)] (1) y = a/(a-2b)[(a-b)sinphi+bsin((a-b)/bphi)] (2) has involute x = (a-2b)/a[(a-b)cosphi+bcos((a-b)/bphi)] (3) y = ...
1 ... 402|403|404|405|406|407|408 ... 937 Previous Next

...