Search Results for ""

A uniquely pancyclic graph is a graph that has exactly one cycle of each length between 3 and the graph's vertex count. Uniquely pancyclic graphs are therefore a special case ...

A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...

The unitary divisor function sigma_k^*(n) is the analog of the divisor function sigma_k(n) for unitary divisors and denotes the sum-of-kth-powers-of-the-unitary divisors ...

Universal algebra studies common properties of all algebraic structures, including groups, rings, fields, lattices, etc. A universal algebra is a pair A=(A,(f_i^A)_(i in I)), ...

A universal differential equation (UDE) is a nontrivial differential-algebraic equation with the property that its solutions approximate to arbitrary accuracy any continuous ...

Just as the ratio of the arc length of a semicircle to its radius is always pi, the ratio P of the arc length of the parabolic segment formed by the latus rectum of any ...

An untouchable number is a positive integer that is not the sum of the proper divisors of any number. The first few are 2, 5, 52, 88, 96, 120, 124, 146, ... (OEIS A005114). ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

If ABB^' and AC^'C are straight lines with BC and B^'C^' intersecting at D and AB+BD=AC^'+C^'D, then AB^'+B^'D=AC+CD. The origin and some history of this theorem are ...