Search Results for ""

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...

The fundamental theorem of arithmetic states that every positive integer (except the number 1) can be represented in exactly one way apart from rearrangement as a product of ...

Place a point somewhere on a line segment. Now place a second point and number it 2 so that each of the points is in a different half of the line segment. Continue, placing ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

A prime constellation, also called a prime k-tuple, prime k-tuplet, or prime cluster, is a sequence of k consecutive numbers such that the difference between the first and ...

The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...

A prime circle of order 2n is a free circular permutation of the numbers from 1 to 2n with adjacent pairs summing to a prime. The number of prime circles for n=1, 2, ..., are ...

The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...