TOPICS
Search

Search Results for ""


1011 - 1020 of 13134 for binomial theorySearch Results
Let (K,|·|) be a non-Archimedean field. Its valuation ring R is defined to be R={x in K:|x|<=1}. The valuation ring has maximal ideal M={x in K:|x|<1}, and the field R/M is ...
The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.
Vorobiev's theorem states that if F_l^2|F_k, then F_l|k, where F_n is a Fibonacci number and a|b means a divides b. The theorem was discovered by Vorobiev in 1942, but not ...
Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.
A function, continuous in a finite closed interval, can be approximated with a preassigned accuracy by polynomials. A function of a real variable which is continuous and has ...
The negative integers ..., -3, -2, -1.
The positive integers 1, 2, 3, ..., equivalent to N.
The nonnegative integers 0, 1, 2, ....
Course List
In continuum percolation theory, the Boolean-Poisson model is a Boolean model driven by a stationary point process X which is a Poisson process. The Boolean-Poisson model is ...
1 ... 99|100|101|102|103|104|105 ... 1314 Previous Next

...