Search Results for ""

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),... ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

Let sigma_0(n) and sigma_1(n) denote the number and sum of the divisors of n, respectively (i.e., the zeroth- and first-order divisor functions). A number n is called sublime ...

Integers (lambda,mu) for a and b that satisfy Bézout's identity lambdaa+mub=GCD(a,b) are called Bézout numbers. For integers a_1, ..., a_n, the Bézout numbers are a set of ...

The symbol separating the dividend from the divisor in a long division that is drawn as a right parenthesis (or sometimes a straight vertical bar) with an attached vinculum ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function, and define the aliquot sequence of n by ...

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

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

A solitary number is a number which does not have any friends. Solitary numbers include all primes, prime powers, and numbers for which (n,sigma(n))=1, where (a,b) is the ...