TOPICS
Search

Search Results for ""


3831 - 3840 of 8997 for Natural logarithm of 2Search Results
Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...
A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...
The classic treatise in geometry written by Euclid and used as a textbook for more than 1000 years in western Europe. An Arabic version The Elements appears at the end of the ...
A self-intersecting minimal surface which can be generated using the Enneper-Weierstrass parameterization with f(z) = 1 (1) g(z) = zeta. (2) Letting z=re^(iphi) and taking ...
For s>1, the Riemann zeta function is given by zeta(s) = sum_(n=1)^(infty)1/(n^s) (1) = product_(k=1)^(infty)1/(1-1/(p_k^s)), (2) where p_k is the kth prime. This is Euler's ...
The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...
Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...
A generalized continued fraction is an expression of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))), (1) where the partial numerators a_1,a_2,... and partial ...
A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...
Applying the stellation process to the icosahedron gives 20+30+60+20+60+120+12+30+60+60 cells of 11 different shapes and sizes (including the icosahedron itself). The ...
1 ... 381|382|383|384|385|386|387 ... 900 Previous Next

...