Search Results for ""
4061 - 4070 of 13134 for binomial theorySearch Results
The neighborhood complex N(G) of a locally finite graph G is defined as the abstract simplicial complex formed by the subsets of the neighborhoods of all vertices of G.
The nested radical constant is the constant defined by C = sqrt(1+sqrt(2+sqrt(3+sqrt(4+sqrt(5+...))))) (1) = 1.75793275... (2) (OEIS A072449). No closed-form expression is ...
Let pi_n(x)=product_(k=0)^n(x-x_k), (1) then f(x)=f_0+sum_(k=1)^npi_(k-1)(x)[x_0,x_1,...,x_k]+R_n, (2) where [x_1,...] is a divided difference, and the remainder is ...
The next prime function NP(n) gives the smallest prime larger than n. The function can be given explicitly as NP(n)=p_(1+pi(n)), where p_i is the ith prime and pi(n) is the ...
A nialpdrome is a number whose hexadecimal digits are in nonincreasing order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 32, 33, 34, 48, 49, ...
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) ...
A ring is called left (respectively, right) Noetherian if it does not contain an infinite ascending chain of left (respectively, right) ideals. In this case, the ring in ...
A non-Abelian group, also sometimes known as a noncommutative group, is a group some of whose elements do not commute. The simplest non-Abelian group is the dihedral group ...
The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...
A number which is simultaneously a nonagonal number N_m and heptagonal number Hep_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(5n-4). (1) Completing the ...
...
View search results from all Wolfram sites (34966 matches)

