Search Results for ""

The largest square dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, ... (OEIS A008833).

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

A number n which is an integer multiple k of the sum of its unitary divisors sigma^*(n) is called a unitary k-multiperfect number. There are no odd unitary multiperfect ...

A unitary perfect number is a number n which is the sum of its unitary divisors with the exception of n itself. There are no odd unitary perfect numbers, and it has been ...

The algebraics, sometimes denoted A (Derbyshire 2004, p. 173), are the set of algebraic numbers. The set of algebraic numbers is implemented in the Wolfram Language as ...

A set is said to be bounded from below if it has a lower bound. Consider the real numbers with their usual order. Then for any set M subset= R, the infimum infM exists (in R) ...

A term for number theory.

The odd part Od(n) of a positive integer n is defined by Od(n)=n/(2^(b(n))), where b(n) is the exponent of the exact power of 2 dividing n. Od(n) is therefore the product of ...

The set of prime numbers, sometimes denoted P (Derbyshire 2004, p. 163), and implemented in the Wolfram Language as Primes. In the Wolfram Language, a quantity can be tested ...

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...