Search Results for ""
601 - 610 of 1800 for Prime powerSearch Results
A determinant which arises in the solution of the second-order ordinary differential equation x^2(d^2psi)/(dx^2)+x(dpsi)/(dx)+(1/4h^2x^2+1/2h^2-b+(h^2)/(4x^2))psi=0. (1) ...
The nth coefficient in the power series of a univalent function should be no greater than n. In other words, if f(z)=a_0+a_1z+a_2z^2+...+a_nz^n+... is a conformal mapping of ...
The Pochhammer symbol (x)_n = (Gamma(x+n))/(Gamma(x)) (1) = x(x+1)...(x+n-1) (2) (Abramowitz and Stegun 1972, p. 256; Spanier 1987; Koepf 1998, p. 5) for n>=0 is an ...
A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...
The Mertens constant B_1, also known as the Hadamard-de la Vallee-Poussin constant, prime reciprocal constant (Bach and Shallit 1996, p. 234), or Kronecker's constant ...
The decimal period of a repeating decimal is the number of digits that repeat. For example, 1/3=0.3^_ has decimal period one, 1/11=0.09^_ has decimal period two, and ...
Taniguchi's constant is defined as C_(Taniguchi) = product_(p)[1-3/(p^3)+2/(p^4)+1/(p^5)-1/(p^6)] (1) = 0.6782344... (2) (OEIS A175639), where the product is over the primes ...
A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...
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 SI prefixes are the 20 power-of-10 prefixes specified by the Bureau International des Poids et Mesures (BIPM) for use in the International System of Units (SI). They are ...
...
View search results from all Wolfram sites (323922 matches)

