TOPICS
Search

Search Results for ""


391 - 400 of 1780 for Prime FactorSearch Results
A mapping of random number triples to points in spherical coordinates according to theta = 2piX_n (1) phi = piX_(n+1) (2) r = sqrt(X_(n+2)) (3) in order to detect unexpected ...
Given a statistical distribution with measured mean, mode, and standard deviation sigma, the Pearson mode skewness is (mean-mode)/sigma. The function was incorrectly ...
Planck's's radiation function is the function f(x)=(15)/(pi^4)1/(x^5(e^(1/x)-1)), (1) which is normalized so that int_0^inftyf(x)dx=1. (2) However, the function is sometimes ...
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 ...
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 ...
The word weight has many uses in mathematics. It can refer to a function w(x) (also called a weighting function or weighting function) used to normalize orthogonal functions. ...
A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...
The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...
In Note M, Burnside (1955) states, "The contrast that these results shew between groups of odd and of even order suggests inevitably that simple groups of odd order do not ...
Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...
1 ... 37|38|39|40|41|42|43 ... 178 Previous Next

...