TOPICS
Search

Search Results for ""


131 - 140 of 150 for factorableSearch Results
Pythagoras's theorem states that the diagonal d of a square with sides of integral length s cannot be rational. Assume d/s is rational and equal to p/q where p and q are ...
A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...
The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...
The Rogers-Ramanujan continued fraction is a generalized continued fraction defined by R(q)=(q^(1/5))/(1+q/(1+(q^2)/(1+(q^3)/(1+...)))) (1) (Rogers 1894, Ramanujan 1957, ...
Finch (2001, 2003) defines a k-rough (or k-jagged) number to be positive integer all of whose prime factors are greater than or equal to k. Greene and Knuth define "unusual ...
A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...
The extension field K of a field F is called a splitting field for the polynomial f(x) in F[x] if f(x) factors completely into linear factors in K[x] and f(x) does not factor ...
A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...
The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...
The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...
1 ... 11|12|13|14|15 Previous Next

...