TOPICS
Search

Search Results for ""


3231 - 3240 of 3922 for Line graphsSearch Results
A Hilbert space is a vector space H with an inner product <f,g> such that the norm defined by |f|=sqrt(<f,f>) turns H into a complete metric space. If the metric defined by ...
The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...
A number n is called k-hyperperfect if n = 1+ksum_(i)d_i (1) = 1+k[sigma(n)-n-1], (2) where sigma(n) is the divisor function and the summation is over the proper divisors ...
An inellipse inconic that is an ellipse. The locus of the centers of the ellipses inscribed in a triangle is the interior of the medial triangle. Newton gave the solution to ...
The complexity c_n of an integer n is the least number of 1s needed to represent it using only additions, multiplications, and parentheses. For example, the numbers 1 through ...
The number of different triangles which have integer side lengths and perimeter n is T(n) = P(n,3)-sum_(1<=j<=|_n/2_|)P(j,2) (1) = [(n^2)/(12)]-|_n/4_||_(n+2)/4_| (2) = ...
The inverse erf function is the inverse function erf^(-1)(z) of the erf function erf(x) such that erf(erf^(-1)(x)) = x (1) erf^(-1)(erf(x)) = x, (2) with the first identity ...
Solving the nome q for the parameter m gives m(q) = (theta_2^4(q))/(theta_3^4(q)) (1) = (16eta^8(1/2tau)eta^(16)(2tau))/(eta^(24)(tau)), (2) where theta_i(q)=theta_i(0,q) is ...
A polynomial is said to be irreducible if it cannot be factored into nontrivial polynomials over the same field. For example, in the field of rational polynomials Q[x] (i.e., ...
The sequence of numbers {j_n} giving the number of digits in the three-fold power tower n^(n^n). The values of n^(n^n) for n=1, 2, ... are 1, 16, 7625597484987, ... (OEIS ...
1 ... 321|322|323|324|325|326|327 ... 393 Previous Next

...