Search Results for ""

A function f:A->B such that B is a set of numbers.

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...

Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

Let M be the midpoint of the arc AMB. Pick C at random and pick D such that MD_|_AC (where _|_ denotes perpendicular). Then AD=DC+BC.

A function whose value decreases more quickly than any polynomial is said to be an exponentially decreasing function. The prototypical example is the function e^(-x), plotted ...

The Cartesian product of a finite or infinite set of modules over a ring with only finitely many nonzero entries in each sequence.

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...