Search Results for ""

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

A method of determining the maximum number of positive and negative real roots of a polynomial. For positive roots, start with the sign of the coefficient of the lowest (or ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

An SIR model is an epidemiological model that computes the theoretical number of people infected with a contagious illness in a closed population over time. The name of this ...

A fibered category F over a topological space X consists of 1. a category F(U) for each open subset U subset= X, 2. a functor i^*:F(U)->F(V) for each inclusion i:V↪U, and 3. ...

In n-dimensional Lorentzian space R^n=R^(1,n-1), the light cone C^(n-1) is defined to be the subset consisting of all vectors x=(x_0,x_1,...,x_(n-1)) (1) whose squared ...

A smooth curve which corresponds to the limiting case of a histogram computed for a frequency distribution of a continuous distribution as the number of data points becomes ...

How many times can a shape be completely surrounded by copies of itself without being able to tile the entire plane, i.e., what is the maximum (finite) Heesch number?

For an n-dimensional map, the Lyapunov characteristic exponents are given by sigma_i=lim_(N->infty)ln|lambda_i(N)| for i=1, ..., n, where lambda_i is the Lyapunov ...