Search Results for ""

An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...

An odd composite number N is called a Somer-Lucas d-pseudoprime (with d>=1) if there exists a nondegenerate Lucas sequence U(P,Q) with U_0=0, U_1=1, D=P^2-4Q, such that ...

Let n be an elliptic pseudoprime associated with (E,P), and let n+1=2^sk with k odd and s>=0. Then n is a strong elliptic pseudoprime when either kP=0 (mod n) or 2^rkP=0 (mod ...

A lamp is turned on for 1/2 minute, off for 1/4 minute, on for 1/8 minute, etc. At the end of one minute, the lamp switch will have been moved aleph_0 times, where aleph_0 is ...

A unitary perfect number is a number n which is the sum of its unitary divisors with the exception of n itself. There are no odd unitary perfect numbers, and it has been ...

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

In Note M, Burnside (1955) states, "The contrast that these results shew between groups of odd and of even order suggests inevitably that simple groups of odd order do not ...

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...