Search Results for ""

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

A sequence of numbers alpha_n is said to be uncorrelated if it satisfies lim_(n->infty)1/(2n)sum_(m=-n)^nalpha_m^2=1 lim_(n->infty)1/(2n)sum_(m=-n)^nalpha_malpha_(k+m)=0 for ...

The sum of the first n odd numbers is a square number, sum_(k=1)^n(2k-1)=n^2. A sort of converse also exists, namely the difference of the nth and (n-1)st square numbers is ...

A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...

Call a number of the form n^2-k a "near-square number." Numbers of the form n^2-5 for n=1, 2, ... are -4, -1, 4, 11, 20, 31, 44, 59, 76, 95, ... (OEIS A028875). These are ...

Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

The unique even prime number 2. All other primes are odd primes. Humorously, that means 2 is the "oddest" prime of all. The sequence 2, 4, 6, 10, 14, 22, 26, 34, 38, ... ...

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

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...