Search Results for ""

A large number defined as where the circle notation denotes "n in n squares," and triangles and squares are expanded in terms of Steinhaus-Moser notation (Steinhaus 1999, pp. ...

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

In floating-point arithmetic, a biased exponent is the result of adding some constant (called the bias) to the exponent chosen to make the range of the exponent nonnegative. ...

The approximation for pi given by pi approx sqrt((40)/3-2sqrt(3)) (1) = 1/3sqrt(120-18sqrt(3)) (2) = 3.141533.... (3) In the above figure, let OA=OF=1, and construct the ...

Let B_n(r) be the n-dimensional closed ball of radius r>1 centered at the origin. A function which is defined on B(r) is called an extension to B(r) of a function f defined ...

A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...

Hoffman (1998, p. 90) calls the sum of the exponents in the prime factorization of a number its roundness. The first few values for n=1, 2, ... are 0, 1, 1, 2, 1, 2, 1, 3, 2, ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...