Search Results for ""

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive ...

A sequence produced by the instructions "reverse, add to the original, then sort the digits." For example, after 668, the next iteration is given by 668+866=1534, so the next ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

A primality test that provides an efficient probabilistic algorithm for determining if a given number is prime. It is based on the properties of strong pseudoprimes. The ...

Ramanujan's two-variable theta function f(a,b) is defined by f(a,b)=sum_(n=-infty)^inftya^(n(n+1)/2)b^(n(n-1)/2) (1) for |ab|<1 (Berndt 1985, p. 34; Berndt et al. 2000). It ...

In 1913, Ramanujan asked if the Diophantine equation of second order 2^n-7=x^2, sometimes called the Ramanujan-Nagell equation, has any solutions other than n=3, 4, 5, 7, and ...

The concept of "random close packing" was shown by Torquato et al. (2000) to be mathematically ill-defined idea that is better replaced by the notion of "maximally random ...

A random walk is a sequence of discrete steps in which each step is randomly taken subject to some set of restrictions in allowed directions and step lengths. Random walks ...

The rascal triangle is a number triangle with numbers arranged in staggered rows such that a_(n,r)=n(r-n)+1. (1) The published study of this triangle seems to have originated ...

Any square matrix T has a canonical form without any need to extend the field of its coefficients. For instance, if the entries of T are rational numbers, then so are the ...