Search Results for ""

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...

The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...

The technique of extracting the content from geometric (tensor) equations by working in component notation and rearranging indices as required. Index gymnastics is a ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

Mills' constant can be defined as the least theta such that f_n=|_theta^(3^n)_| is prime for all positive integers n (Caldwell and Cheng 2005). The first few f_n for n=1, 2, ...

Let a module M in an integral domain D_1 for R(sqrt(D)) be expressed using a two-element basis as M=[xi_1,xi_2], where xi_1 and xi_2 are in D_1. Then the different of the ...

A sentence is a logic formula in which every variable is quantified. The concept of a sentence is important because formulas with variables that are not quantified are ...

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 ...

If p is a prime >3, then the numerator of the harmonic number H_(p-1)=1+1/2+1/3+...+1/(p-1) (1) is divisible by p^2 and the numerator of the generalized harmonic number ...