TOPICS
Search

Search Results for ""


331 - 340 of 678 for Direct Search FactorizationSearch Results
A proof which can be accomplished using only real numbers (i.e., real analysis instead of complex analysis; Hoffman 1998, pp. 92-93).
Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...
Numbers 1, alpha_1, ..., alpha_L are rationally independent iff under the action of rotation rho_(alpha_1)×...×rho_(alpha_L) on the L-dimensional torus, every orbit is ...
The method of exhaustion was an integral-like limiting process used by Archimedes to compute the area and volume of two-dimensional lamina and three-dimensional solids.
Maximize the amount of floor space which can be covered with a fixed tile (Hoffman 1998, p. 173).
A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...
The term "continued fraction" is used to refer to a class of expressions of which generalized continued fraction of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))) ...
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...
Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...
Given a positive integer m>1, let its prime factorization be written m=p_1^(a_1)p_2^(a_2)p_3^(a_3)...p_k^(a_k). (1) Define the functions h(n) and H(n) by h(1)=1, H(1)=1, and ...
1 ... 31|32|33|34|35|36|37 ... 68 Previous Next

...