Search Results for ""

An infinite sequence {a_i} of positive integers is called strongly independent if any relation sumepsilon_ia_i, with epsilon_i=0, +/-1, or +/-2 and epsilon_i=0 except ...

Let h>=2 and let A_1, A_2, ..., A_h be sets of integers. The sumset A_1+A_2+...+A_h is the set of all integers of the form a_1+a_2+...+a_h, where a_i is a member of A_i for ...

Given a sequence of real numbers a_n, the supremum limit (also called the limit superior or upper limit), written lim sup and pronounced 'lim-soup,' is the limit of ...

An aliquot sequence computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

Sociable numbers computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...

If for each positive integer h, the sequence {u_(n+h)-u_n} is uniformly distributed (mod 1), then the sequence {u_n} is uniformly distributed (mod 1) (Montgomery 2001).

An infinite sequence of positive integers a_i satisfying 1<=a_1<a_2<a_3<... (1) is an A-sequence if no a_k is the sum of two or more distinct earlier terms (Guy 1994). Such ...

Gelfond's theorem, also called the Gelfond-Schneider theorem, states that a^b is transcendental if 1. a is algebraic !=0,1 and 2. b is algebraic and irrational. This provides ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...