Search Results for ""
851 - 860 of 4349 for prime numbersSearch Results
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, ...
The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.
If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.
The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...
The sequence {|_(3/2)^n_|} is given by 1, 1, 2, 3, 5, 7, 11, 17, 25, 38, ... (OEIS A002379). The first few composite |_(3/2)^n_| occur for n=8, 9, 10, 11, 12, 13, 14, 15, 16, ...
A number of the form Tt_n=((n+2; 2); 2)=1/8n(n+1)(n+2)(n+3) (Comtet 1974, Stanley 1999), where (n; k) is a binomial coefficient. The first few values are 3, 15, 45, 105, 210, ...
Liouville's constant, sometimes also called Liouville's number, is the real number defined by L=sum_(n=1)^infty10^(-n!)=0.110001000000000000000001... (OEIS A012245). ...
The plastic constant P, sometimes also called le nombre radiant, the minimal Pisot number, plastic number, plastic ratio, platin number, Siegel's number, or silver number, is ...
...
View search results from all Wolfram sites (34076 matches)

