TOPICS
Search

Search Results for ""


2821 - 2830 of 3638 for Ordinary Differential Equation Systemwit...Search Results
Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...
The base 2 method of counting in which only the digits 0 and 1 are used. In this base, the number 1011 equals 1·2^0+1·2^1+0·2^2+1·2^3=11. This base is used in computers, ...
A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...
A function f(x) is said to have bounded variation if, over the closed interval x in [a,b], there exists an M such that |f(x_1)-f(a)|+|f(x_2)-f(x_1)|+... +|f(b)-f(x_(n-1))|<=M ...
A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...
Let X and Y be CW-complexes, and let f:X->Y be a continuous map. Then the cellular approximation theorem states that any such f is homotopic to a cellular map. In fact, if ...
A centered triangular number is a centered polygonal number consisting of a central dot with three dots around it, and then additional dots in the gaps between adjacent dots. ...
A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...
There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...
A set of numbers a_0, a_1, ..., a_(m-1) (mod m) form a complete set of residues, also called a covering system, if they satisfy a_i=i (mod m) for i=0, 1, ..., m-1. For ...
1 ... 280|281|282|283|284|285|286 ... 364 Previous Next

...