Search Results for ""

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

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

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

Given a series of positive terms u_i and a sequence of positive constants {a_i}, use Kummer's test rho^'=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)) (1) with a_n=n, giving ...

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

The limiting rabbit sequence written as a binary fraction 0.1011010110110..._2 (OEIS A005614), where b_2 denotes a binary number (a number in base-2). The decimal value is ...

A sequence which arises in the hypothetical reproduction of a population of rabbits. Let the substitution system map 0->1 correspond to young rabbits growing old, and 1->10 ...

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 Rabinovich-Fabrikant equation is the set of coupled linear ordinary differential equations given by x^. = y(z-1+x^2)+gammax (1) y^. = x(3z+1-x^2)+gammay (2) z^. = ...