Search Results for ""
481 - 490 of 4428 for Combinations of operations on whole numb...Search Results
The conjecture proposed by Catalan in 1888 and extended by E. Dickson that each aliquot sequence ends in a prime, a perfect number, or a set of sociable numbers. The ...
The term perfect square is used to refer to a square number, a perfect square dissection, or a factorable quadratic polynomial of the form a^2+/-2ab+b^2=(a+/-b)^2.
A Poulet number whose divisors d all satisfy d|2^d-2. The first few are 341, 1387, 2047, 2701, 3277, 4033, 4369, 4681, 5461, 7957, 8321, ... (OEIS A050217).
A nonregular number, also called an infinite decimal (Havil 2003, p. 25), is a positive number that has an infinite decimal expansion. In contrast, a number that has a finite ...
An operation on a knot or link diagram which preserves its crossing number. Thistlethwaite used 13 different moves in generating a list of 16-crossing alternating knots ...
Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...
A number n for which the product of divisors is equal to n^2. The first few are 1, 6, 8, 10, 14, 15, 21, 22, ... (OEIS A007422).
One of Cantor's ordinal numbers omega, omega+1, omega+2, ..., omega+omega, omega+omega+1, ... which is "larger" than any whole number.
A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...
An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...
...
View search results from all Wolfram sites (241184 matches)

