Search Results for ""

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

If P(n) is a sentential formula depending on a variable n ranging in a set of real numbers, the sentence P(n) for every sufficiently large n (1) means exists N such that P(n) ...

An integer n is called a super unitary perfect number if sigma^*(sigma^*(n))=2n, where sigma^*(n) is the unitary divisor function. The first few are 2, 9, 165, 238, 1640, ... ...

A superabundant number is a composite number n such that sigma(n)/n>sigma(k)/k for all k<n, where sigma(n) is the divisor function. Superabundant numbers are closely related ...

The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...

For a graph vertex x of a graph, let Gamma_x and Delta_x denote the subgraphs of Gamma-x induced by the graph vertices adjacent to and nonadjacent to x, respectively. The ...

In nonstandard analysis, the limitation to first-order analysis can be avoided by using a construction known as a superstructure. Superstructures are constructed in the ...

Let K be a T2-topological space and let F be the space of all bounded complex-valued continuous functions defined on K. The supremum norm is the norm defined on F by ...

In general, an unresolved nth root, commonly involving a radical symbol RadicalBox[x, n], is known as a surd. However, the term surd or "surd expression" (e.g., Hardy 1967, ...