Search Results for ""

The term "aliquot divisor" is commonly used to mean two distinct but related things. The first definition is a number that divides another exactly. For instance, 1, 2, 3, and ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

The least common denominator of a collection of fractions (p_1)/(q_1),...,(p_n)/(q_n) is the least common multiple LCM(q_1,...,q_n) of their denominators.

A number which does not divide another exactly. For instance, 4 and 5 are aliquant divisors of 6. A number which is not an aliquant divisor (i.e., one that does divide ...

The sum of powers of even divisors of a number. It is the analog of the divisor function for even divisors only and is written sigma_k^((e))(n). It is given simply in terms ...

d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...

Given an arithmetic series {a_1,a_1+d,a_1+2d,...}, the number d is called the common difference associated to the sequence.

Given a geometric sequence {a_1,a_1r,a_1r^2,...}, the number r is called the common ratio associated to the sequence.

The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...