TOPICS
Search

Search Results for ""


311 - 320 of 2772 for Integer PartSearch Results
The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...
The complex numbers are the field C of numbers of the form x+iy, where x and y are real numbers and i is the imaginary unit equal to the square root of -1, sqrt(-1). When a ...
The confluent hypergeometric function of the first kind _1F_1(a;b;z) is a degenerate form of the hypergeometric function _2F_1(a,b;c;z) which arises as a solution the ...
Compass and straightedge geometric constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ...
In response to a letter from Goldbach, Euler considered sums of the form s_h(m,n) = sum_(k=1)^(infty)(1+1/2+...+1/k)^m(k+1)^(-n) (1) = ...
Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...
Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...
The plots above show the values of the function obtained by taking the natural logarithm of the gamma function, lnGamma(z). Note that this introduces complicated branch cut ...
A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., omega(G)=chi(G). A graph that is not a perfect ...
An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...
1 ... 29|30|31|32|33|34|35 ... 278 Previous Next

...