Search Results for ""

A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...

If there is no integer 0<x<p such that x^2=q (mod p), i.e., if the congruence (35) has no solution, then q is said to be a quadratic nonresidue (mod p). If the congruence ...

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

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...

There are a number of equations known as the Riccati differential equation. The most common is z^2w^('')+[z^2-n(n+1)]w=0 (1) (Abramowitz and Stegun 1972, p. 445; Zwillinger ...

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...

The rising factorial x^((n)), sometimes also denoted <x>_n (Comtet 1974, p. 6) or x^(n^_) (Graham et al. 1994, p. 48), is defined by x^((n))=x(x+1)...(x+n-1). (1) This ...

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...