Search Results for ""

A topological transformation in which a surface is made out of an infinitely elastic material which, however, may not be torn or cut. Using this simple prescription gives the ...

The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...

Consider a bivariate normal distribution in variables x and y with covariance rho=rho_(11)=<xy>-<x><y> (1) and an arbitrary function g(x,y). Then the expected value of the ...

A short set of data that proves the primality of a number. A certificate can, in general, be checked much more quickly than the time required to generate the certificate. ...

An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A Banach space X is called prime if each infinite-dimensional complemented subspace of X is isomorphic to X (Lindenstrauss and Tzafriri 1977). Pełczyński (1960) proved that ...

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 characteristic function f(n)={1 n is prime; 0 n otherwise (1) of primes has values 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, ... (OEIS A010051) for n=1, 2, ...

k+2 is prime iff the 14 Diophantine equations in 26 variables wz+h+j-q=0 (1) (gk+2g+k+1)(h+j)+h-z=0 (2) 16(k+1)^3(k+2)(n+1)^2+1-f^2=0 (3) 2n+p+q+z-e=0 (4) ...