TOPICS
Search

Search Results for ""


551 - 560 of 2860 for Factor/remainder theoremSearch Results
Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...
If one looks inside a flat origami without unfolding it, one sees a zigzagged profile, determined by an alternation of "mountain-creases" and "valley-creases." The numbers of ...
Write down the positive integers in row one, cross out every k_1th number, and write the partial sums of the remaining numbers in the row below. Now cross off every k_2th ...
If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...
Let f(x) be integrable in [-1,1], let (1-x^2)f(x) be of bounded variation in [-1,1], let M^' denote the least upper bound of |f(x)(1-x^2)| in [-1,1], and let V^' denote the ...
Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.
Let R be the class of expressions generated by 1. The rational numbers and the two real numbers pi and ln2, 2. The variable x, 3. The operations of addition, multiplication, ...
A product space product_(i in I)X_i is compact iff X_i is compact for all i in I. In other words, the topological product of any number of compact spaces is compact. In ...
All curves of constant width of width w have the same perimeter piw.
If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then a^(lambda(n))=1 (mod n), where lambda is the Carmichael function.
1 ... 53|54|55|56|57|58|59 ... 286 Previous Next

...