Search Results for ""

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

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

An ambiguous figure in which the brain switches between seeing a rabbit and a duck. The duck-rabbit was "originally noted" by American psychologist Joseph Jastrow (Jastrow ...

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

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

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 word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...