Search Results for ""

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

Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...

The sigmoid function, also called the sigmoidal curve (von Seggern 2007, p. 148) or logistic function, is the function y=1/(1+e^(-x)). (1) It has derivative (dy)/(dx) = ...

A solvable Lie group is a Lie group G which is connected and whose Lie algebra g is a solvable Lie algebra. That is, the Lie algebra commutator series ...

A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...

There are several q-analogs of the cosine function. The two natural definitions of the q-cosine defined by Koekoek and Swarttouw (1998) are given by cos_q(z) = ...

There are several q-analogs of the sine function. The two natural definitions of the q-sine defined by Koekoek and Swarttouw (1998) are given by sin_q(z) = ...

A notation for large numbers due to Steinhaus (1999). In circle notation, is defined as n in n squares, where numbers written inside squares (and triangles) are interpreted ...

A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...

The term used by Hunter and Madachy (1975, p. 24) and Madachy (1979, p. 87) to refer to a panmagic square.