Search Results for ""

Let gamma be a path in C, w=f(z), and theta and phi be the tangents to the curves gamma and f(gamma) at z_0 and w_0. If there is an N such that f^((N))(z_0) != 0 (1) ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

In common usage, a cardinal number is a number used in counting (a counting number), such as 1, 2, 3, .... In formal set theory, a cardinal number (also called "the ...

The Eulerian number <n; k> gives the number of permutations of {1,2,...,n} having k permutation ascents (Graham et al. 1994, p. 267). Note that a slightly different ...

A palindromic prime is a number that is simultaneously palindromic and prime. The first few (base-10) palindromic primes are 2, 3, 5, 7, 11, 101, 131, 151, 181, 191, 313, ...

The mean triangle area of a triangle picked inside a regular n-gon of unit area is A^__n=(9cos^2omega+52cosomega+44)/(36n^2sin^2omega), (1) where omega=2pi/n (Alikoski 1939; ...

A friend of a number n is another number m such that (m,n) is a friendly pair.

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

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 bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...