Search Results for ""

A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...

The links curve is the quartic curve given by the Cartesian equation (x^2+y^2-3x)^2=4x^2(2-x). (1) The area enclosed by the outer envelope is A_(envelope)=1/6(9pi+8) (2) and ...

A superegg is a solid described by the equation |sqrt((x^2+y^2)/(a^2))|^n+|z/b|^n=1. (1) The special case n=2 gives a spheroid. Special cases of volume V_n are given by V_1 = ...

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

A (2n)×(2n) complex matrix A in C^(2n×2n) is said to be Hamiltonian if J_nA=(J_nA)^(H), (1) where J_n in R^(2n×2n) is the matrix of the form J_n=[0 I_n; I_n 0], (2) I_n is ...

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 largest square dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, ... (OEIS A008833).

A hyperbola for which the asymptotes are perpendicular, also called an equilateral hyperbola or right hyperbola. This occurs when the semimajor and semiminor axes are equal. ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...