Search Results for ""
2211 - 2220 of 13134 for Graph TheorySearch Results
Let (K,|·|) be a valuated field. The valuation group G is defined to be the set G={|x|:x in K,x!=0}, with the group operation being multiplication. It is a subgroup of the ...
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 ...
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, ....
If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...
The Zermelo-Fraenkel axioms are the basis for Zermelo-Fraenkel set theory. In the following (Jech 1997, p. 1), exists stands for exists, forall means for all, in stands for ...
...
View search results from all Wolfram sites (33872 matches)

