Search Results for ""
3131 - 3140 of 4110 for Whole numbers and IntegersSearch Results
The second theorem of Mertens states that the asymptotic form of the harmonic series for the sum of reciprocal primes is given by sum_(p<=x)1/p=lnlnx+B_1+o(1), where p is a ...
The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...
Niven's theorem states that if x/pi and sinx are both rational, then the sine takes values 0, +/-1/2, and +/-1. Particular cases include sin(pi) = 0 (1) sin(pi/2) = 1 (2) ...
The set of octonions, also sometimes called Cayley numbers and denoted O, consists of the elements in a Cayley algebra. A typical octonion is of the form ...
Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...
A set of two numbers or objects linked in some way is said to be a pair. The pair a and b is usually denoted (a, b), and is generally considered to be ordered, making it a ...
A test for the primality of Fermat numbers F_n=2^(2^n)+1, with n>=2 and k>=2. Then the two following conditions are equivalent: 1. F_n is prime and (k/F_n)=-1, where (n/k) is ...
A planar connected graph is a graph which is both planar and connected. The numbers of planar connected graphs with n=1, 2, ... nodes are 1, 1, 2, 6, 20, 99, 646, 5974, ...
A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...
A prime-distance graph is a distance graph with distance set given by the set of prime numbers.
...
View search results from all Wolfram sites (71114 matches)

