Search Results for ""

A space-filling function which maps a one-dimensional interval into a two-dimensional area. Plane-filling functions were thought to be impossible until Hilbert discovered the ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

Reverse Polish notation (RPN) is a method for representing expressions in which the operator symbol is placed after the arguments being operated on. Polish notation, in which ...

The Spearman rank correlation coefficient, also known as Spearman's rho, is a nonparametric (distribution-free) rank statistic proposed by Spearman in 1904 as a measure of ...

Let two spheres of radii R and r be located along the x-axis centered at (0,0,0) and (d,0,0), respectively. Not surprisingly, the analysis is very similar to the case of the ...

A two-dimensional map also called the Taylor-Greene-Chirikov map in some of the older literature and defined by I_(n+1) = I_n+Ksintheta_n (1) theta_(n+1) = theta_n+I_(n+1) ...

There are at least two distinct notions of when a point process is stationary. The most commonly utilized terminology is as follows: Intuitively, a point process X defined on ...

There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic. Group-theoretically, let Gamma_0(N) be the modular group Gamma0, ...